#include<iostream>

#include<cstdio>

#include<cstdlib>

#include<cstring>

#include<string>

#include<algorithm>

#include<set>

using namespace std;

const int N = 1e5 + ;

int n, x0, m, nxta[N], nxtb[N], f[N][];

typedef long long ll;

ll fa[N][], fb[N][];

struct node2{

    int h, pos;

    inline bool operator < (const node2 &b) const{

        return h < b.h;

    }

}data[N];

struct node{

    int pos, dis;

    inline bool operator < (const node &b) const{

        if(dis != b.dis) return dis < b.dis;

        return data[pos].h < data[b.pos].h;

    }

}t[];

set<node2> S;

inline int read(){

    int i = , f = ; char ch = getchar();

    for(; (ch < '' || ch > '') && ch != '-'; ch = getchar());

    if(ch == '-') f = -, ch = getchar();

    for(; ch >= '' && ch <= ''; ch = getchar())

        i = (i << ) + (i << ) + (ch - '');

    return i * f;

}

inline void wr(ll x){

    if(x < ) putchar('-'), x = -x;

    if(x > ) wr(x / );

    putchar(x %  + '');

}

inline void Find(int x){

    int    cnt = ;

    set<node2>::iterator it = S.find(data[x]);

    if(it != S.begin()){

        --it;

        t[++cnt] = (node){it->pos, abs(data[x].h - it->h)};

        if(it != S.begin())        {

            --it;

            t[++cnt] = (node){it->pos, abs(data[x].h - it->h)};

            ++it;

        }

        ++it;

    }

    if((++it) != S.end()){

        t[++cnt] = (node){it->pos, abs(it->h - data[x].h)};

        if((++it) != S.end()){

            t[++cnt] = (node){it->pos, abs(it->h - data[x].h)};

            --it;

        }

        --it;

    }

    sort(t + , t + cnt + );

    nxtb[x] = t[].pos;

    if(cnt > )

        nxta[x] = t[].pos;

}

inline void init(){

    for(int i = ; i <= n; i++){

        int na = nxta[i], nb = nxtb[na];

        fa[i][] = na ? abs(data[na].h - data[i].h) : ;

        fb[i][] = nb ? abs(data[nb].h - data[na].h) : ;

        f[i][] = nb;

    }

    for(int j = ; j <= ; j++)

        for(int i = ; i <= n; i++){

            f[i][j] = f[f[i][j - ]][j - ];

            fa[i][j] = fa[i][j - ] + fa[f[i][j - ]][j - ];

            fb[i][j] = fb[i][j - ] + fb[f[i][j - ]][j - ];

        }

}

inline void query(int s, ll x, ll &na, ll &nb){

    for(int i = ; i >= ; i--)

        if(f[s][i] && fa[s][i] + fb[s][i] <= x){

            na += fa[s][i], nb += fb[s][i];

            x -= fa[s][i] + fb[s][i];

            s = f[s][i];

        }

    int posa = nxta[s], d = abs(data[s].h - data[posa].h);

    if(posa &&  d <= x) na += d;

}

int main(){

    n = read();

    for(int i = ; i <= n; i++) data[i] = (node2){read(), i};

    for(int i = n; i >= ; i--){

        S.insert(data[i]);

        if(i ^ n) Find(i);

    }

    init();

    x0 = read();

    int ans = ;

    ll ansa = , ansb = ;

    for(int i = ; i <= n; i++){

        ll na = , nb = ;

        query(i, x0, na, nb);

        if(!ans || ansa * nb > ansb * na) ans = i, ansa = na, ansb = nb;

    }

    wr(ans), putchar('\n');

    m = read();

    for(int i = ; i <= m; i++){

        ll na = , nb = ;

        int st = read(), x = read();

        query(st, x, na, nb);

        wr(na), putchar(' '), wr(nb), putchar('\n');

    }

    return ;

}