#include<bits/stdc++.h>

#define LL long long

#define fi first

#define se second

#define mk make_pair

#define PLL pair<LL, LL>

#define PLI pair<LL, int>

#define PII pair<int, int>

#define SZ(x) ((int)x.size())

#define ull unsigned long long

using namespace std;

const int N = 2e5 + ;

const int inf = 0x3f3f3f3f;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const int mod = 1e9 + ;

const double eps = 1e-;

const double PI = acos(-);

int n, m, a[N], x[N], id[N];

bool cmp(const int& a, const int& b) {

    return x[a] < x[b];

}

int main() {

    scanf("%d%d", &n, &m);

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

        scanf("%d", &a[i]);

        x[i] = a[i];

        id[i] = i;

    }

    sort(id + , id +  + n, cmp);

    sort(x + , x +  + n);

    while(m--) {

        int p, l;

        scanf("%d%d", &p, &l);

        while() {

            int be = p, len = ;

            int it1 = upper_bound(x + , x +  + n, a[p] + l) - x - ;

            len += abs(x[it1] - a[p]);

            l -= abs(x[it1] - a[p]);

            p = id[it1];

            int it2 = lower_bound(x + , x +  + n, a[p] - l) - x;

            len += abs(x[it2] - a[p]);

            l -= abs(x[it2] - a[p]);

            p = id[it2];

            int ed = p;

            if(be == ed && be == id[it1]) {

                break;

            }

            if(be == ed) {

                l %= len;

            }

        }

        printf("%d\n", p);

    }

    return ;

}

/*

*/