Cod sursa(job #977192)
#include<stdio.h>
#define NMAX 250007
int d[20][NMAX];
inline int Ans(int A, int B){
for(int i = 0; (1 << i) <= B; ++ i)
if((1 << i) & B)
A = d[i][A];
return A;
}
int main(){
int n = 0, A = 0, B = 0, m;
freopen("stramosi.in", "r", stdin);
freopen("stramosi.out", "w", stdout);
scanf("%d %d", &n, &m);
for(int i = 1; i <= n ; ++ i)
scanf("%d", &d[0][i]);
for(int i = 1; (1 << i) <= n; ++ i)
for(int j = 1; j <= n; ++ j)
d[i][j] = d[i - 1][d[i - 1][j]];
for(int i = 1; i <= m; ++ i){
scanf("%d %d", &A, &B);
printf("%d\n", Ans(A, B));
}
return 0;
}