Pagini recente » Cod sursa (job #3163949) | Cod sursa (job #1945565) | Cod sursa (job #3040695) | Cod sursa (job #898414) | Cod sursa (job #1547474)
#include <iostream>
#include <fstream>
#include <string.h>
//#include <vector>
//#include <queue>
//#include <algorithm>
using namespace std;
const int nmax = 250002;
int n,v[nmax];
int main(){
freopen("stramosi.in", "r", stdin);
freopen("stramosi.out", "w", stdout);
int m;
scanf("%d %d", &n, &m);
v[0] = 0;
for (int i = 1; i <= n; i++)
scanf("%d", &v[i]);
int a, b;
for (; m--;){
scanf("%d %d", &a, &b);
while (b != 1 && v[a] != 0) {
b--;
a = v[a];
}
printf("%d\n", v[a]);
}
fclose(stdin);
fclose(stdout);
return 0;
}