#include <iostream>
#include <vector>
#include <unordered_set>
#define maxi 350000
using namespace std;
vector<int> V[maxi+10];
vector<pair<int,int>> G[maxi+10];
unordered_set<int> radacini;
bool viz[maxi+10];
int nod[maxi+10],ans[maxi+10],n,m,x,y;
class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};
void DFS(int x,int lvl)
{
    viz[x]=true;
    nod[lvl]=x;
    for(auto a:G[x])
    {
        if(lvl-a.first>=0)
        {
            ans[a.second]=nod[lvl-a.first];
        }
    }
    for(auto a:V[x])
    {
        if(!viz[a])
            DFS(a,lvl+1);
    }
}
int main()
{
    InParser f("stramosi.in");
    OutParser g("stramosi.out");
    f>>n>>m;
    for(int i=1;i<=n;i++)
    {
        f>>x;
        if(x)
        {
            V[x].push_back(i);
        }
        else radacini.insert(i);
    }
    for(int i=1;i<=m;i++)
    {
        f>>x>>y;
        G[x].push_back(make_pair(y,i));
    }
   for(auto a:radacini)
    DFS(a,0);
   for(int i=1;i<=m;i++)
    g<<ans[i]<<'\n';
    return 0;
}