#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define grep(i,u) for (int i = head[u],v = e[i].v; i; v = e[i = e[i].nxt].v)
#define LL long long
#define pii pair<int,int>
#define pll pair<LL,LL>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
LL read() {
	LL  x = 0,y = 1; char ch = getchar(); while (!isdigit(ch)) {if (ch == '-') y = -y; ch = getchar();}
	while (isdigit(ch)) {x = x*10+ch-'0'; ch = getchar();} return x*y;
}
namespace qiqi {
	const LL N = 2e5+5,INF = 0x3f3f3f3f3f3f3f3f; int n,Q;
	struct Pnt {
		LL x,y;
		Pnt(LL _x = 0,LL _y = 0) {
			x = _x; y = _y;
		}
		Pnt friend operator + (Pnt a,Pnt b) {
			return Pnt(a.x+b.x,a.y+b.y);
		}
		Pnt friend operator - (Pnt a,Pnt b) {
			return Pnt(a.x-b.x,a.y-b.y);
		}
		double slp() {return 1.0*y/x;}
	} p[N],stk[N];
	LL get(vector<Pnt> &a,Pnt k) {
		int l = 0,r = (int)a.size()-1;
		while (l != r) {
			int mid = l+((r-l)>>1);
			(a[mid+1]-k).slp() >= (a[mid]-k).slp() ? r = mid : l = mid+1;
		}
		Pnt res = a[l]-k;
		return res.y >= 0 ? res.y/res.x : -1;
	}
	struct Seg {
#define ls (x<<1)
#define rs (ls|1)
		int L,R; vector<Pnt> a[N*4];
		void build(int x,int l,int r) {
			int tp = 0;
			rep(i,l,r) {
				while (tp > 1 && (p[i]-stk[tp-1]).slp() >= (p[i]-stk[tp]).slp()) --tp;
				stk[++tp] = p[i];
			}
			rep(i,1,tp) a[x].eb(stk[i]);
			if (l == r) return; int mid = l+((r-l)>>1);
			build(ls,l,mid); build(rs,mid+1,r);
		}
		void init(int _L,int _R) {
			build(1,L = _L,R = _R);
		}
		LL qry(int x,int l,int r,int pl,int pr,Pnt k) {
			if (pl <= l && r <= pr) return get(a[x],k);
			int mid = l+((r-l)>>1); LL res = INF;
			if (pl <= mid) res = min(res,qry(ls,l,mid,pl,pr,k));
			if (pr > mid) res = min(res,qry(rs,mid+1,r,pl,pr,k));
			return res;
		}
		LL qry(int pl,int pr,Pnt k) {
			return qry(1,L,R,pl,pr,k);
		}
	} seg;
	void main() {
		n = read(); Q = read();
		rep(i,1,n) p[i] = p[i-1]+Pnt(1,read());
		seg.init(1,n);
		while (Q--) {
			int l = read(),r = l+read()-1;
			LL k = seg.qry(l,r,p[l-1]);
			if (k < 0) {
				puts("stay with parents");
			}
			else {
				printf("%lld\n",k);
			}
		}
	}
}
int main() {
	qiqi::main(); return 0;
}