#include <fstream>
#include <vector>

using namespace std;

int main()
{
    ifstream f("stramosi.in");
    ofstream g("stramosi.out");
    int nod, index, n, m;
    bool tulpina = true;

    f >> n >> m;
    vector <int> stramosi(n + 1);
    for(int i = 1; i <= n; ++i){
        f >> stramosi[i];
        if(stramosi[i] != i - 1){
            tulpina = false;
        }
    }
    if(tulpina){ // daca arborele nu se ramifica..adica are un singur nod per nivel
        for(int i = 1; i <= n; ++i){
            f >> nod >> index;
            if(nod - index > 0){
                g << nod - index << "\n";
            }
            else{
                g << 0 << "\n";
            }
        }
    }
    else{
        for(int i = 1; i <= m; ++i){
            f >> nod >> index;
            int stramos = nod;
            while(index && stramos != 0){
                index --;
                stramos = stramosi[stramos];
                //mergem pe vectorul de tati
            }
            if(index != 0){
                //daca nu exista al x-ulea mostenitor
                g << 0 << "\n";
            }
            else{
                g << stramos << "\n";
            }
        }
    }

    return 0;
}