#include<bits/stdc++.h>

using namespace std;

#define gc c=getchar()
#define r(x) read(x)
#define ll __int128

template<typename T>
inline void read(T &x){
	x=0;T k=1;char gc;
	while(!isdigit(c)){if(c=='-')k=-1;gc;}
	while(isdigit(c)){x=x*10+c-'0';gc;}x*=k;
}

const int N = 2e5 + 7;

ll a[N];
int sta[N];
int top;

vector<pair<int, int>>Q[N];
ll Ans[N];

int main(){
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	int n, m; r(n), r(m);
	for(int i = 1; i <= n; ++i){
		r(a[i]);
	}
	for(int i = 1; i <= m; ++i){
		int s, k; r(s), r(k);
		Q[s + k - 1].push_back({s, i});
	}
	top = 0;
	for(int i = 1; i <= n; ++i){
		a[i] += a[i - 1];
		while(top >= 2 && (a[i] - a[sta[top]]) * (sta[top] - sta[top - 1]) <= (a[sta[top]] - a[sta[top - 1]]) * (i - sta[top])){
			--top;
		}
		sta[++top] = i;
		for(auto &tmp : Q[i]){
			int l = 1, r = top, ans = 0;
			while(l <= r){
				int mid = (l + r) >> 1;
				if(sta[mid] < tmp.first){
					ans = mid;
					l = mid + 1;
				}
				else{
					r = mid - 1;
				}
			}
			assert(sta[ans + 1] >= tmp.first);
			l = ans + 1, r = top;
			while(l <= r){
				int mid1 = l + (r - l) / 3;
				int mid2 = r - (r - l) / 3;
				if((a[sta[mid1]] - a[tmp.first - 1]) * (sta[mid2] - tmp.first + 1) <= (a[sta[mid2]] - a[tmp.first - 1]) * (sta[mid1] - tmp.first + 1)){
					r = mid2 - 1;
					ans = mid2;
				}
				else{
					l = mid1 + 1;
					ans = mid1;
				}
			}
			if(a[sta[ans]] - a[tmp.first - 1] < 0) Ans[tmp.second] = -1;
			else Ans[tmp.second] = (a[sta[ans]] - a[tmp.first - 1]) / (sta[ans] - tmp.first + 1);
		}
	}
	for(int i = 1; i <= m; ++i){
		if(~Ans[i]) printf("%lld\n", (long long)Ans[i]);
		else puts("stay with parents");
	}
	
	return 0;
}