#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
const int N = 2e5 + 10;
int n, m;
struct Point {
    int x, y;
};
Point p[N];
Point operator+(Point u, Point v) { return {u.x + v.x, u.y + v.y}; }
Point operator-(Point u, Point v) { return {u.x - v.x, u.y - v.y}; }
int SDet(Point u, Point v) { 
    __int128 tmp = (__int128)u.x * v.y - (__int128)u.y * v.x;
    return  tmp < 0 ? -1 : tmp > 0; 
}
namespace Seg {
    vector<Point> g[N << 1];
    inline void Build() {
        for (int i = 1; i <= n; ++i)
            for (int j = i + N; j; j >>= 1)
            g[j].push_back(p[i]);
        for (int t = N; t; --t) if (g[t].size() > 2) {
            int tp = 2;
            for (int i = 2; i < (int)g[t].size(); ++i) {
                while (tp >= 2 && SDet(g[t][i] - g[t][tp - 2], g[t][tp - 1] - g[t][tp - 2]) >= 0) --tp;
                g[t][tp++] = g[t][i];
            }
            g[t].resize(tp);
        }
    }
    inline int Calc(Point b) {
        // printf("* %lld %lld\n", b.x, b.y);
        return b.y < 0 ? -1 : b.y / b.x;
    }
    inline int _Ask(Point b, int i) {
        if (g[i].empty()) return 1e9;
        int ans = Calc(g[i][0] - b);
        for (auto l = g[i].begin() + 1, r = g[i].end(); l < r; ) {
            auto mid = l + (r - l) / 2;
            int p1 = Calc(*mid - b);
            int p2 = Calc(*prev(mid) - b);
            ans = min(ans, p1);
            if (p2 < p1) l = mid + 1; else r = mid;
        }
        return ans;
    }
    inline int Ask(Point b, int x, int y) {
        int ans = 1e9;
        for (int l = N + x - 1, r = N + y + 1; l ^ r ^ 1; l >>= 1, r >>= 1) {
            if (~l & 1) ans = min(ans, _Ask(b, l ^ 1));
            if ( r & 1) ans = min(ans, _Ask(b, r ^ 1));
        }
        return ans;
    }
}
signed main() {
    scanf("%lld%lld", &n, &m);
    for (int i = 1; i <= n; ++i) {
        scanf("%lld", &p[i].y);
        p[i].y += p[i - 1].y;
        p[i].x = i;
    }
    Seg::Build();
    for (int i = 1, x, y; i <= m; ++i) {
        scanf("%lld%lld", &x, &y);
        y = x + y - 1;
        int ans = Seg::Ask(p[x - 1], x, y);
        if (ans == -1) puts("stay with parents");
        else printf("%lld\n", ans);
    }
    return 0;
}