#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct Mo {
	int width;
	vector<int>left, right, order, ans, index;
	vector<bool>v;
	int n, q;
	Mo(int _n, int _q) :n(_n), q(_q) {
		width = (int)sqrt(_n);
		order.resize(q);
		iota(all(order), 0);
		ans.resize(q);
		v.resize(n, false);
		left.resize(q);
		right.resize(q);
		index.resize(q);
	}
	// add,query[l,r)
	void query(int idx, int l, int r, int x) {
		left[idx] = l;
		right[idx] = r;
		index[idx] = x;
	}
	// run
	void run(const vector<int>&a, const vector<int>&b) {
		sort(all(order), [&](int lh, int rh) {
			int lblock = left[lh] / width;
			int rblock = left[rh] / width;
			if (lblock != rblock)return lblock < rblock;
			if (lblock & 1) return right[lh] < right[rh];
			return right[lh] > right[rh];
			});
		int nl = 0, nr = 0;
		vector<int>v(n);
		vector<int>pos(n);
		rep(i, n)v[i] = i;
		rep(i, n)pos[i] = i;
		auto add = [&](int idx) {
			pos[v[a[idx]]] = b[idx];
			pos[v[b[idx]]] = a[idx];
			swap(v[a[idx]], v[b[idx]]);
		};
		auto del = [&](int idx) {
			v[pos[a[idx]]] = b[idx];
			v[pos[b[idx]]] = a[idx];
			swap(pos[a[idx]], pos[b[idx]]);
		};
		auto ansset = [&](int idx) {
			ans[idx] = v[index[idx]];
		};
		for (auto &idx : order) {
			while (nl > left[idx])del(--nl);
			while (nr < right[idx])add(nr++);
			while (nl < left[idx])del(nl++);
			while (nr > right[idx])add(--nr);
			ansset(idx);
		}
	}
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k, q; cin >> n >> k >> q;
	vector<int>a(k), b(k);
	rep(i, k) {
		cin >> a[i] >> b[i];
		a[i]--, b[i]--;
	}
	vector<int>l(q), r(q), x(q);
	rep(i, q) {
		cin >> l[i] >> r[i] >> x[i];
		l[i]--, /*r[i]--,*/ x[i]--;
	}
	vector<int>order(q),ans(q);
	rep(i, q)order[i] = i;
	int width = 10;
	sort(all(order), [&](int lh, int rh) {
		int lblock = l[lh] / width;
		int rblock = l[rh] / width;
		if (lblock != rblock)return lblock < rblock;
		if (lblock & 1) return r[lh] < r[rh];
		return r[lh] > r[rh];
		});
	int nl = 0, nr = 0;
	vector<int>v(n);
	vector<int>pos(n);
	rep(i, n)v[i] = i;
	rep(i, n)pos[i] = i;
	auto add = [&](int idx) {
		pos[v[a[idx]]] = b[idx];
		pos[v[b[idx]]] = a[idx];
		swap(v[a[idx]], v[b[idx]]);
	};
	auto del = [&](int idx) {
		v[pos[a[idx]]] = b[idx];
		v[pos[b[idx]]] = a[idx];
		swap(pos[a[idx]], pos[b[idx]]);
	};
	auto ansset = [&](int idx) {
		ans[idx] = v[x[idx]];
	};
	for (auto &idx : order) {
		while (nl > l[idx])del(--nl);
		while (nr < r[idx])add(nr++);
		while (nl < l[idx])del(nl++);
		while (nr > r[idx])add(--nr);
		ansset(idx);
	}
	rep(i, q)cout << ans[i] + 1 << endl;
	return 0;
}