#include <bits/stdc++.h>
#define Nmax 250005
#define Log 18
FILE *fin  = freopen("stramosi.in", "r", stdin);
FILE *fout = freopen("stramosi.out", "w", stdout);

using namespace std;
int n, m, A[Nmax][Log];
int main()
{
    int i, j, b, p, node;
    scanf("%d %d", &n, &m);
    /// direct ancestor
    for(i = 1; i <= n; ++ i)
        scanf("%d", &A[i][0]);

    for(j = 1; (1 << j) <= n; ++ j)
        for(i = 1; i <= n; ++ i)
            if(A[i][j - 1])
                A[i][j] = A[A[i][j - 1]][j - 1];
    while(m --)
    {
        scanf("%d %d", &node, &p);
        for(b = 0; (1 << b) <= p; ++ b)
            if(p & (1 << b))
            {
                node = A[node][b];
                if(node == 0)
                    break;
            }
        printf("%d\n", node);
    }

    return 0;
}