#include <bits/stdc++.h>

#define MAX 100005
#define endl '\n'

using namespace std;

typedef long long ll;
typedef double lf;
typedef vector<ll> vi;

ll next_table[MAX], group[MAX], pos_in_group[MAX], tag_table[MAX], table_tag[MAX];
vi cycles[MAX];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, k;
    cin >> n >> k;

    for (ll i = 0; i < n; ++i) {
        ll x;
        cin >> x;
        cin >> next_table[--x];
        next_table[x]--;
        tag_table[i] = x;
        table_tag[x] = i;
    }
    vector<bool> analizados(n);
    int grupo = 0;
    for (ll j = 0; j < n; ++j) {
        if (analizados[j])
            continue;
        ll pos = j, p = 0;
        while (!analizados[pos]) {
            group[pos] = grupo;
            pos_in_group[pos] = p++;
            cycles[grupo].push_back(pos);
            analizados[pos] = true;
            pos = next_table[pos];
        }
        grupo++;
    }

    ll p, time;
    for (ll i = 0; i < k; ++i) {
        cin >> p >> time;

        ll len = cycles[group[table_tag[--p]]].size();
        ll q = pos_in_group[table_tag[p]];
        cout << tag_table[cycles[group[table_tag[p]]][(time + q) % len]] + 1 << endl;
    }
}