#include <cstdio>
#define MAXN 250000
#define LOG 19
using namespace std;
int d[LOG][MAXN+1], n, m;
void calculate()
{
    for(int j=1;(1<<j)<=n;++j)
        for(int i=1;i<=n;++i)
            d[j][i]=d[j-1][d[j-1][i]];
}
inline int query(int p, int x)
{
    for(int i=0;(1<<i)<=p;++i)
        if((1<<i)&(p))
            x=d[i][x];
    return x;
}
int main()
{
    freopen("stramosi.in", "r", stdin);
    freopen("stramosi.out", "w", stdout);
    int p, x;
    scanf("%d%d", &n, &m);
    for(int i=1;i<=n;++i)
        scanf("%d", &d[0][i]);
    calculate();
    for(int i=1;i<=m;++i)
    {
        scanf("%d%d", &x, &p);
        printf("%d\n", query(p, x));
    }
    return 0;
}