#include <bits/stdc++.h>

using namespace std;

typedef __int128 ll;
const ll MX = 1e18;
const int N = 2e5 + 3;

int n, m, a[N];
ll p[N];

ll area2(ll x1, ll y1, ll x2, ll y2, ll x3, ll y3){
	return x1 * y2 + x2 * y3 + x3 * y1 - x1 * y3 - x2 * y1 - x3 * y2;
}

ll area2(pair<ll, ll> p1, pair<ll, ll> p2, pair<ll, ll> p3){
	return area2(p1.first, p1.second, p2.first, p2.second, p3.first, p3.second);
}

struct ConvexHull{
	vector<pair<ll, ll>> v;
	ConvexHull(){}
	ConvexHull(const vector<pair<ll, ll>> v2){
		for(int i = 0; i < v2.size(); ++i){
			while(v.size() >= 2 && area2(v[v.size() - 2], v[v.size() - 1], v2[i]) <= 0){
				v.pop_back();
			}
			v.push_back(v2[i]);
		}
	}
	ll queryPoint(ll x, ll y, pair<ll, ll> p){
		x = p.first - x;
		y = p.second - y;
		if(y < 0)
			return -1;
		return y / x;
	}
	ll query(ll x, ll y){
		if(v.empty()) return MX;
		int l = 0, r = (int)v.size() - 1;
		while((r - l) > 2){
			int mid1 = (2 * l + r) / 3;
			int mid2 = (l + 2 * r) / 3;
			if(queryPoint(x, y, v[mid1]) <= queryPoint(x, y, v[mid2]))
				r = mid2;
			else
				l = mid1;
		}
		ll res = MX;
		for(int i = l; i <= r; ++i)
			res = min(res, queryPoint(x, y, v[i]));
		return res;
	}
};

struct SegmentTree{
	ConvexHull ch[4 * N];

	void init(int i = 0, int l = 1, int r = n){
		vector<pair<ll, ll>> v(r - l + 1);
		for(int j = l; j <= r; ++j)
			v[j - l] = pair<ll, ll>{j, p[j]};
		ch[i] = ConvexHull(v);

		if(l == r) return;
		int mid = (l + r) >> 1;
		init(2 * i + 1, l, mid);
		init(2 * i + 2, mid + 1, r);
	}

	ll query(int sl, int sr, ll x, ll y, int i = 0, int l = 1, int r = n){
		if(sr < l || r < sl) return MX;
		if(sl <= l && r <= sr) return ch[i].query(x, y);
		int mid = (l + r) >> 1;
		return min(query(sl, sr, x, y, 2 * i + 1, l, mid), query(sl, sr, x, y, 2 * i + 2, mid + 1, r));
	}
} st;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);

	cin >> n >> m;
	for(int i = 1; i <= n; ++i)
		cin >> a[i];
	for(int i = 1; i <= n; ++i)
		p[i] = a[i] + p[i - 1]; 

	st.init();

	for(int i = 1; i <= m; ++i){
		int s, k;
		cin >> s >> k;

		int l = s, r = s + k - 1;
		ll t = st.query(l, r, l - 1, p[l - 1]);
		int ans = (int)t;
		if(ans == -1)
			cout << "stay with parents\n"; 
		else
			cout << ans << "\n";
	}
}