#include <bits/stdc++.h>

#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
#define int long long

using namespace std;

const int N = 2e5+5;
int tr[N<<2], arr[N], a[N];

int combine(int a, int b){
    return min(a,b);
}

void build(int idx, int l, int r){
    if(l == r){
        tr[idx] = arr[l];
        return;
    }
    int mid = l+r>>1;
    build(idx<<1, l, mid);
    build(idx<<1|1, mid+1, r);
    tr[idx] = min(tr[idx<<1], tr[idx<<1|1]);
}

int query(int ll, int x, int idx, int l, int r){
    if(l == r){
        if(tr[idx] < x) return l;
        else return -1;
    }
    int mid = l+r>>1;
    if(ll <= mid && tr[idx<<1] < x){
        int res = query(ll, x, idx<<1, l, mid);
        if(res != -1) return res;
    }

    if(tr[idx<<1|1] < x){
        return query(ll, x, idx<<1|1, mid+1, r);
    }
    return -1;
}

struct qq{
    int l, r, idx;
};
int ans[N];
int n,m;

void parallelBS(int l, int r, vector<qq> queries){
    if(l == r){
        for(auto [a,b,idx] : queries){
            ans[idx] = l;
        }
        return;
    }
    int mid = l + (r - l + 1) / 2;
    vector<qq> left, right;

    for(int i = 1; i <= n; i++){
        arr[i] = a[i] - mid*i;
    }

    build(1, 1, n);

    for(auto q : queries){
        int idx = query(q.l, arr[q.l-1], 1, 1, n);
        if(idx <= q.r && idx != -1){
            left.push_back(q);
        }else{
            right.push_back(q);
        }
    }

    if(left.size()) parallelBS(l, mid-1, left);
    if(right.size()) parallelBS(mid, r, right);
}


signed main(){
    fastio
    cin >> n >> m;

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

    vector<qq> queries;

    for(int i = 1; i <= m; i++){
        int l,r;
        cin >> l >> r;
        queries.push_back({l,l+r-1, i});
    }

    parallelBS(-1, 1e12, queries);

    for(int i = 1; i <= m; i++){
        if(ans[i] == -1){
            cout << "stay with parents\n";
        }else{
            cout << ans[i] << "\n";
        }
    }
}