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 nn warriors, he places them on a straight line in front of the main gate, in a way that the ii-th warrior stands right after(i−1)(i−1)-th warrior. The first warrior leads the attack.

Each attacker can take up to aiai arrows before he falls to the ground, where aiai is the ii-th warrior's strength.

Lagertha orders her warriors to shoot kiki arrows during the ii-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 tt, they will all be standing to fight at the end of minute tt.

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

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

The second line contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109) that represent the warriors' strengths.

The third line contains qq integers k1,k2,…,kqk1,k2,…,kq (1≤ki≤10141≤ki≤1014), the ii-th of them represents Lagertha's order at the ii-th minute: kiki arrows will attack the warriors.

Output qq lines, the ii-th of them is the number of standing warriors after the ii-th minute.

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 <cstdio>

 #include <algorithm>

 #include <vector>

 #include <queue>

 #include <cstring>

 #include <string>

 using namespace std;

 const int maxn = 2e5 + ;

 long long a[maxn], b[maxn], sum[maxn], sum1[maxn];

 int main() {

     long long n, q;

     while(scanf("%lld%lld", &n, &q) != EOF) {

         sum[] = ;

         for (long long i =  ; i <= n ; i++) {

             scanf("%lld", &a[i]);

             sum[i] = sum[i - ] + a[i];

         }

         for (long long i =  ; i <= q ; i++) {

             scanf("%lld", &b[i]);

         }

         long long temp = , cnt, ret = ;

         for (long long i =  ; i <= q ; i++) {

             cnt = upper_bound(sum + , sum + n + , sum[temp] + b[i] + ret) - sum - ;

             ret = a[cnt + ] - (sum[cnt + ] - sum[temp] - b[i] - ret);

             if (ret == a[cnt + ]) ret = ;

             temp = cnt;

             if (temp == n  )  {

                 temp = ;

                 ret = ;

             }

             printf("%lld\n", n - temp);

         }

     }

     return ;

 }