#include<cstdio>
#define N 100005

struct LNode {
    int v;
    int level;
    LNode* next;
};
//int powof2[25];
int n, m;
int M[18][4*N];
int p[N];
int arrH[4*N];
int arrV[4*N];
int aux;
LNode** r;
int posInEuler[N];
int LG[4*N];
LNode* eulerTour(int ind, int l) {
    arrV[++arrV[0]] = ind;
    arrH[++arrH[0]] = l;
    if(r[ind] != 0) {
        for(LNode* it = r[ind]; it != 0; it = it -> next) {
            eulerTour(it -> v, l + 1);
            arrV[++arrV[0]] = ind;
            arrH[++arrH[0]] = l;
        }
    }
    return 0;
}
void insert(LNode*& last, int val) {
    LNode* nou = new LNode();
    nou -> v = val;
    nou -> next = last;
    last = nou;
}
LNode** convertToSon() {
    LNode** r = new LNode*[n + 2];
    for(int i = 1; i <= n; i++) {
      r[i] = 0;
    }
    for(int i = 2; i <= n; i++) {
        insert(r[p[i]], i);
    }
    return r;
}
int min(int a, int b) {
    if(a < b) return a;
    return b;
}
void init(int k) {
    for(int i = 2; i <= k; i++)
     LG[i] = LG[i / 2] + 1;
}
void RMQ(int p) {
    for(int i = 1; i <= arrH[0]; i++) {
      if(posInEuler[arrV[i]] == 0)
        posInEuler[arrV[i]] = i;
     M[0][i] = i;
    }
    int nr = arrH[0];
    init(nr);
    for(int i = 1; i <= 18; i++)  {
        int wh2go = nr - (1 << i) + 1;
        for(int j = 1; j <= wh2go; j++)
         if (arrH[M[i-1][j]] < arrH[M[i-1][j + (1 << (i - 1))]])
          M[i][j] = M[i-1][j];
         else
          M[i][j] = M[i-1][j + (1 << (i - 1))];
    }

    for(int i = 1; i <= p; i++) {
        int x, y;
        scanf("%d %d",&x,&y);
        int lf = posInEuler[x];
        int right = posInEuler[y];
        if(lf > right) {
            lf = posInEuler[y];
            right = posInEuler[x];
        }
        int how = right - lf + 1;
        int p = LG[how];
        if(arrH[M[p][lf]] < arrH[M[p][right - (1 << p) + 1]])
         printf("%d\n",arrV[M[p][lf]]);
        else
         printf("%d\n",arrV[M[p][right- (1 << p) + 1]]);
    }

}
int main() {

    freopen("lca.in","r",stdin);
    freopen("lca.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(int i = 2; i <= n; i++)
     scanf("%d", &p[i]);
    r = convertToSon();
    eulerTour(1, 0);
    RMQ(m);
    return 0;
}