#include //#include 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 template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } struct Mo { int width; vectorleft, right, order, ans, index; vectorv; 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); } // add,query[l,r) void query(int l, int r, int x) { left.push_back(l); right.push_back(r); index.push_back(x); } // run void run(const vector

&data) { 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; vectorv(n); vectorpos(n); rep(i, n)v[i] = i; rep(i, n)pos[i] = i; auto add = [&](int idx) { int x = v[data[idx].first]; int y = v[data[idx].second]; swap(pos[x], pos[y]); swap(v[x], v[y]); }; auto del = [&](int idx) { int x = v[pos[data[idx].first]]; int y = v[pos[data[idx].second]]; swap(v[x], v[y]); swap(pos[x], pos[y]); }; 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

a(k); rep(i, k) { int x, y; cin >> x >> y; x--, y--; a[i] = { x,y }; } Mo mo(n, q); rep(i, q) { int l, r, x; cin >> l >> r >> x; l--, r--, x--; mo.query(l, r + 1, x); } mo.run(a); rep(i, q) cout << mo.ans[i] + 1 << endl; return 0; }