Valhalla Siege

Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar’s warriors are falling in battle.

Ivar has n warriors, he places them on a straight line in front of the main gate, in a way that the i-th warrior stands right after (i−1)-th warrior. The first warrior leads the attack.

Each attacker can take up to ai arrows before he falls to the ground, where ai is the i-th warrior’s strength.

Lagertha orders her warriors to shoot ki arrows during the i-th minute, the arrows one by one hit the first still standing warrior. After all Ivar’s warriors fall and all the currently flying arrows fly by, Thor smashes his hammer and all Ivar’s warriors get their previous strengths back and stand up to fight again. In other words, if all warriors die in minute t, they will all be standing to fight at the end of minute t.

The battle will last for q minutes, after each minute you should tell Ivar what is the number of his standing warriors.

Input
The first line contains two integers n and q (1≤n,q≤200000) — the number of warriors and the number of minutes in the battle.

The second line contains n integers a1,a2,…,an (1≤ai≤109) that represent the warriors’ strengths.

The third line contains q integers k1,k2,…,kq (1≤ki≤1014), the i-th of them represents Lagertha’s order at the i-th minute: ki arrows will attack the warriors.

Output
Output q lines, the i-th of them is the number of standing warriors after the i-th minute.

Examples
input
5 5
1 2 1 2 1
3 10 1 1 1
output
3
5
4
4
3
input
4 4
1 2 3 4
9 1 10 6
output
1
4
4
1
Note
In the first example:

after the 1-st minute, the 1-st and 2-nd warriors die.
after the 2-nd minute all warriors die (and all arrows left over are wasted), then they will be revived thus answer is 5 — all warriors are alive.
after the 3-rd minute, the 1-st warrior dies.
after the 4-th minute, the 2-nd warrior takes a hit and his strength decreases by 1.
after the 5-th minute, the 2-nd warrior dies.

#include 
#include 

using namespace std;

typedef long long ll;
const int N=2e5+10;

ll prefix_sum[N];

int main()
{
    int n,q;
    while(cin>>n>>q)
    {
        ll a;
        prefix_sum[0]=0;
        for(int i=1;i<=n;i++)
        {
            cin>>a;
            prefix_sum[i]=prefix_sum[i-1]+a;
        }

        ll k;
        ll sum=0;
        for(int i=1;i<=q;i++)
        {
            cin>>k;
            sum+=k;

            int pos=upper_bound(prefix_sum+1,prefix_sum+1+n,sum)-prefix_sum;
            int ans=n-pos+1;

            if(ans==0)
            {
                sum=0;
                ans=n;
            }
            cout<<ans<<endl;
        }
    }
    return 0;
}