#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <cstdio>
using namespace std;

int N, K, Q;
vector<int> A, B;
vector<pair<int, pair<int, int>>> query;
vector<int> ans_lst;
int D;

vector<vector<int>> mo;
vector<int> perm;
vector<int> idx;

void init()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> N >> K >> Q;
    A.resize(K);
    B.resize(K);
    for (int k = 0; k < K; k++)
    {
        cin >> A[k] >> B[k];
        A[k]--; B[k]--;
    }
    query.resize(Q);
    for (int q = 0; q < Q; q++)
    {
        int l, r, x;
        cin >> l >> r >> x;
        l--; x--;
        query[q] = {l, {r, x}};
    }
    D = max(1, (int)sqrt(K));
    mo.resize((K+D-1)/D+1);
    for (int q = 0; q < Q; q++)
    {
        int l = query[q].first, r = query[q].second.first;
        mo[l/D].push_back(q);
    }
    perm.resize(N);
    idx.resize(N);
    for (int i = 0; i < N; i++)
    {
        perm[i] = i;
        idx[i] = i;
    }
}

void solve()
{
    ans_lst.resize(Q);
    int L = 0, R = 0;
    for (int d = 0; d < (K+D-1)/D+1; d++)
    {
        sort(mo[d].begin(), mo[d].end(), [&](int i, int j) {
            return query[i].second.first > query[j].second.first;
        });
        for (int q : mo[d])
        {
            int l = query[q].first, r = query[q].second.first, x = query[q].second.second;
            while (L > l)
            {
                L--;
                swap(idx[A[L]], idx[B[L]]);
                swap(perm[idx[A[L]]], perm[idx[B[L]]]);
            }
            while (R < r)
            {
                swap(perm[A[R]], perm[B[R]]);
                idx[perm[A[R]]] = A[R];
                idx[perm[B[R]]] = B[R];
                R++;
            }
            while (L < l)
            {
                swap(idx[A[L]], idx[B[L]]);
                swap(perm[idx[A[L]]], perm[idx[B[L]]]);
                L++;
            }
            while (r < R)
            {
                R--;
                swap(perm[A[R]], perm[B[R]]);
                idx[perm[A[R]]] = A[R];
                idx[perm[B[R]]] = B[R];
            }
            ans_lst[q] = perm[x]+1;
        }
    }
    for (int i = 0; i < Q; i++)
    {
        cout << ans_lst[i] << '\n';
    }
}

int main()
{
    init();
    solve();
    return 0;
}