#include <iostream>
#include <fstream>
using namespace std;
ifstream ka("stramosi.in");
ofstream ki("stramosi.out");

const int N_MAX = 2500000;
const int LOG_MAX = 24;

int log[N_MAX + 1];
int stramos[N_MAX + 1][LOG_MAX];

int srch(int p, int q)
{
    if(p == 0)
        return q;
    return srch(p - (1 << log[p]), stramos[q][log[p]]);
}

int n, m, p, q;
int main()
{
    ka >> n >> m;
    for(int i = 1; i <= n; i++)
        ka >> stramos[i][0];
    for(int i = 2; i <= n; i++)
        log[i] = log[i / 2] + 1;
    for(int j = 1; j <= log[n]; j++)
        for(int i = 1; i <= n; i++)
            stramos[i][j] = stramos[stramos[i][j-1]][j-1];
    for(int i = 1; i <= m; i++)
    {
        ka >> q >> p;
        ki << srch(p, q) << '\n';
    }
}