#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second

using namespace std;
using namespace atcoder;

using ll = long long;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
using vpil = vector<pil>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;
using vvpli = vector<vector<pli>>;
using vvpll = vector<vpll>;
using vvpil = vector<vpil>;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

struct state{
    int l,r,i,x;
 
    state(int l=0,int r=0,int i=0,int x=0) : l(l),r(r),i(i),x(x) {}
 
    bool operator<(state const &ot) const{
        return r < ot.r;
    }
};

int main(){

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

    vi p(n),qq(n);
    rep(i,n){
        p[i] = i;
        qq[p[i]] = i;
    }
    
    vi ans(q);
    
    ll D = ceill((long double)k/sqrtl((long double)q));
    int maxc = k/D;
    vector<vector<state>> pock(maxc+1);

    vpii v(k);
    rep(i,k){
        int a,b; cin>>a>>b;
        a--; b--;
        v[i] = {a,b};
    }
        
    rep(i,q){
        int l,r,x; cin>>l>>r>>x;
        l--; r--; x--;
        pock[l/D].pb(state(l,r,i,x));
    }
    
    auto swap_pq = [&](int i,int j)->void{
        swap(qq[p[i]] , qq[p[j]]);
        swap(p[i] , p[j]);

        return;
    };
    
    auto add = [&](int l,int r,int type) -> pii{
        if (type == 0){
            // assert(l > 0);
            swap_pq(qq[v[l-1].fi] , qq[v[l-1].se]);
            l--;
        }else{
            // assert(r < k-1);
            swap_pq(v[r+1].fi , v[r+1].se);
            r++;
        }
    
        return {l,r};
    };
    
    auto del = [&](int l,int r,int type) -> pii{
        if (type == 0){
            // assert(l < r);
            swap_pq(qq[v[l].fi] , qq[v[l].se]);
            l++;
        }else{
            // assert(l < r);
            swap_pq(v[r].fi , v[r].se);
            r--;
        }
    
        return {l,r};
    };
    
    auto to = [&](int stl,int str,int gol,int gor){
        int x = gol - stl; 
        int y = gor - str;
    
        while(x != 0 || y != 0){
            if (y > 0){
                pii p = add(stl,str,1);
                stl = p.fi;
                str = p.se;
                y--;
            }else if (y < 0){
                pii p = del(stl,str,1);
                stl = p.fi;
                str = p.se;
                y++;
            }
        
            if (x > 0){
                pii p = del(stl,str,0);
                stl = p.fi;
                str = p.se;
                x--;
            }else if(x < 0){
                pii p = add(stl,str,0);
                stl = p.fi;
                str = p.se;
                x++;
            }
        }
    };
    
    int l=0,r=0;

    swap_pq(v[0].fi , v[0].se);

    rep(i,maxc+1){
        if (i%2 == 0){
            sort(rng(pock[i]));
        }else{
            sort(rrng(pock[i]));
        }
    
        fore(y , pock[i]){
            to(l,r,y.l,y.r);
            // show(y.i);
            // deb(y.l , y.r);
            // showv(p);
            // showv(qq);
            ans[y.i] = p[y.x]+1;
            l = y.l;
            r = y.r;
        }
    }
    
    outv;

    return 0;
}