#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)

int N, M, Q;
vector<int> e[200010];
int L[200010], R[200010], X[200010], P[100010], db[60][100010];
ll T[200010];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	
	cin >> N >> M >> Q;
	rep(i, M) cin >> L[i] >> R[i], --L[i], --R[i];
	rep(i, Q) cin >> T[i] >> X[i], --X[i];
	
	rep(i, Q) e[T[i] % M].push_back(i), T[i] /= M;
	rep(i, N) P[i] = i;
	rep(t, M) {
		for(auto i : e[t]) X[i] = P[X[i]];
		swap(P[L[t]], P[R[t]]);
	}
	
	const int K = 60;
	rep(i, N) db[0][i] = P[i];
	rep(k, K - 1) rep(i, N) db[k + 1][i] = db[k][db[k][i]];
	rep(i, Q) {
		rep(k, K) if(T[i] >> k & 1) X[i] = db[k][X[i]];
		cout << X[i] + 1 << "\n";
	}
}