#include<bits/stdc++.h>
using namespace std;
inline long long read(){long long x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}return x*f;
}
#define MN 200005
int n,q;
long long a[MN],k[MN];
int main(){n=read(),q=read();for(int i=1;i<=n;i++) a[i]=read()+a[i-1];for(int i=1;i<=q;i++) k[i]=read(),k[i]=k[i]+k[i-1]>=a[n]?0:k[i]+k[i-1];for(int i=1;i<=q;i++){cout<<n-(upper_bound(a+1,a+n+1,k[i])-a-1)<<endl;}return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}return x*f;
}
#define MP 10005
int a[MP],n,T;
int main(){T=read();while(T--){n=read();for(int i=1;i<=n;i++) a[i]=read();sort(a+1,a+n+1);int sum=0;for(int i=n;i>0;i-=2) sum^=a[i]-a[i-1]-1;printf("%s\n",sum?"Georgia will win":"Bob will win");}return 0;
}

ll get(int x){while(top>tail&&dy(q[tail],q[tail+1])>x*dx(q[tail],q[tail+1])) tail++;return q[tail];
}

void ins(int x){while(top>tail&&dy(q[top-1],q[top])*dx(q[top],x)>=dy(q[top],x)*dx(q[top-1],q[top]))--top;q[++top]=x;
}

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}return x*f;
}
#define MN 500005
#define ll long long
ll T,k,n,f[MN];
struct sq{ll sm,a;}l[MN];
ll top,tail,q[MN];
ll dx(int x,int y){return l[x+1].a-l[y+1].a;}
ll dy(int x,int y){return f[x]-f[y]-l[x].sm+l[y].sm+x*l[x+1].a-y*l[y+1].a;}
ll get(int x){while(top>tail&&dy(q[tail],q[tail+1])>x*dx(q[tail],q[tail+1])) tail++;return q[tail];
}
void ins(int x){while(top>tail&&dy(q[top-1],q[top])*dx(q[top],x)>=dy(q[top],x)*dx(q[top-1],q[top]))--top;q[++top]=x;
}
int main(){T=read();while(T--){n=read(),k=read();for(int i=1;i<=n;i++) l[i].a=read(),l[i].sm=l[i].a+l[i-1].sm;q[top=tail=1]=0;for(int i=1;i<=n;i++){int from=get(i),to=i-k+1;f[i]=f[from]+l[i].sm-l[from].sm-1LL*(i-from)*l[from+1].a;if(to>=k) ins(to);}cout<<f[n]<<endl;}return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;const int N = 40005;
int n;
double x[N],y[N],r[N];bool inside(int i, int j){double dx = x[i]-x[j];double dy = y[i]-y[j];return dx*dx+dy*dy <= r[j]*r[j];
}void solve(){vector<pair<double,int> > events;//圆的左右两端的x坐标for(int i = 0; i < n; i++){events.push_back(make_pair(x[i]-r[i],i));//圆的左端events.push_back(make_pair(x[i]+r[i],i+n));//圆的右端
    }sort(events.begin(), events.end());//平面扫描set<pair<double, int> > outers;//与扫面线相交的最外层的圆的集合vector<int>ans;//最外层圆的列表for(int i = 0; i < events.size(); i++){int id = events[i].second % n;if(events[i].second < n){//扫描到左端set<pair<double, int> >::iterator it = outers.lower_bound(make_pair(y[id],id));if(it != outers.end() && inside(id, it->second)) continue;if(it != outers.begin() && inside(id, (--it)->second)) continue;ans.push_back(id);outers.insert(make_pair(y[id], id));}else{//扫描到右端
            outers.erase(make_pair(y[id], id));}}sort(ans.begin(), ans.end());int len = ans.size();printf("%d\n", len);for(int i = 0; i < len; i++){printf("%d%c",ans[i]+1,i+1 == len?'\n' : ' ');}
}int main(){while(~scanf("%d",&n)){for(int i = 0; i < n; i++)scanf("%lf%lf%lf", &r[i],&x[i],&y[i]);solve();}return 0;
}