#include <cstdio>

int s[100000],x,k,dif,p,q,n,t;

int cauta(int ls, int ld) {
int m;
	while (ls<=ld) {
		m=(ls+ld)/2;
		if(s[m]-dif==x) return m;
		else if (x>s[m]-dif)
			    if(x<s[m+1]-dif) return m;
			    else ls=m+1;
		     else if(x>s[m-1]-dif) return m-1;
		           else ld=m-1;
	}
	return ls;
}

int main()
{
	int i,a;
	FILE *f=fopen("br.in","r");
	FILE *g=fopen("br.out","w");
	fscanf(f,"%d %d",&n,&t);
	fscanf(f,"%d",&s[1]);
	for(i=2; i<=n; i++) {
		fscanf(f,"%d",&a);
		s[i]=s[i-1]+a;
	}
	for(i=1; i<=t; i++) {
		fscanf(f,"%d %d",&k,&x);
		dif=s[k-1];
		if(x>=s[n]) 
			p=n;
		else if(x<s[k]-dif) 
			p=0;
		else
			if(x==s[n]-dif || x>s[n]-dif && x<s[n]-dif+s[1])
				p=n-k+1;
			else if(x<s[n]-dif) {
				q=cauta(k,n-1);
				p=q-k+1;
			}
			else {
				x=x-(s[n]-dif);
				dif=0;
				q=cauta(1,k-1);
				printf("%d\n",q);
				p=q+n-k+1;
			}
		fprintf(g,"%d\n",p);
	}
	fclose(f);
	fclose(g);
}