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

const int N = 1e5 + 10, M = 1e6 + 10;
int n, m, id, L[N], R[N];
vector<pair<int, int> > ad[N], dl[N];

//加入删除 (time, pos)
//1.区间查询 time >= T，pos\in[l,r] 的最小 time
//2.区间查询 time <= T，pos\in[L,l) 的最大 pos
//3.区间查询 time <= T，pos\in(r,R] 的最小 pos
//a[pos] = time [l,r]内 <=T 的最大/最小下标；[l,r]内最小值

pair<int, int> t[M*4];
void build(int p, int l, int r){
    // for(int i = 1; i <= m; ++ i){
    //     t[i] = make_pair(m + 1, 0);
    // }
    t[p] = make_pair(m + 1, l);
    if(l != r){
        int mid = l + r >> 1;
        build(p<<1, l, mid);
        build(p<<1|1, mid+1, r);
    }
}
void add(int p, int l, int r, int x, int v){
    // t[x] = make_pair(v, x);
    if(l == r){
        t[p] = make_pair(v, x);
    } else {
        int mid = l + r >> 1;
        if(x <= mid){
            add(p<<1, l, mid, x, v);
        } else {
            add(p<<1|1, mid+1, r, x, v);
        }
        t[p] = min(t[p<<1], t[p<<1|1]);
    }
}
pair<int, int> qmn(int p, int l, int r, int ql, int qr){
    if(qr < l || r < ql){
        return make_pair(m+1, 0);
    } else if(ql <= l && r <= qr){
        return t[p];
    } else {
        int mid = l + r >> 1;
        return min(qmn(p<<1, l, mid, ql, qr), qmn(p<<1|1, mid+1, r, ql, qr));
    }
    // pair<int, int> mn = make_pair(m + 1, 0);
    // for(int i = ql; i <= qr; ++ i) mn = min(mn, t[i]);
    // return mn;
}
int qmxpos(int p, int l, int r, int ql, int qr, int tt){
    // printf("%d %d %d %d %d %d %d\n", p, l, r, ql, qr, tt, t[p].first);
    if(qr < l || r < ql || t[p].first > tt){
        return 0;
    } else if(l == r){
        // puts("ok");
        return l;
    } else {
        int mid = l + r >> 1;
        int tmp = qmxpos(p<<1|1, mid+1, r, ql, qr, tt);
        if(tmp != 0){
            return tmp;
        } else {
            return qmxpos(p<<1, l, mid, ql, qr, tt);
        }
    }
    // int rs = 0;
    // for(int i = ql; i <= qr; ++ i){
    //     if(t[i].first <= tt) rs = max(rs, i);
    // }
    // return rs;
}
int qmnpos(int p, int l, int r, int ql, int qr, int tt){
    if(qr < l || r < ql || t[p].first > tt){
        return m + 1;
    } else if(l == r){
        // puts("ok");
        return l;
    } else {
        int mid = l + r >> 1;
        int tmp = qmnpos(p<<1, l, mid, ql, qr, tt);
        if(tmp != m + 1){
            return tmp;
        } else {
            return qmnpos(p<<1|1, mid+1, r, ql, qr, tt);
        }
    }
    // int rs = m + 1;
    // for(int i = ql; i <= qr; ++ i){
    //     if(t[i].first <= tt) rs = min(rs, i);
    // }
    // return rs;
}

int main(){
    scanf("%d%d%d", &n, &m, &id);
    for(int i = 1; i <= n; ++ i){
        scanf("%d%d", &L[i], &R[i]);
    }
    for(int i = 1; i <= m; ++ i){
        int x, l, r;
        scanf("%d%d%d", &x, &l, &r);
        // if(l <= 2&&r >= 2){
        ad[l].push_back(make_pair(i, x));
        dl[r].push_back(make_pair(i, x));
        // if(L[2] <= x && x <= R[2]){
        // printf("%d %d %d ", x, l, r);
        //     if(x-L[2] >= R[2] - x) R[2] = x; else L[2] = x;
        //     printf("%d %d\n", L[2], R[2]);
        // }
        // }
    }
    // printf("[%d %d]", L[2], R[2]);
    // puts("----");
    build(1, 1, m);
    for(int i = 1; i <= n; ++ i){
        for(auto j : ad[i]){
            // printf("add %d %d\n", j.first, j.second);
            add(1, 1, m, j.second, j.first);
        }
        int l = L[i], r = R[i], tim = 0;
        while(tim <= m && r - l + 1 > 2){
            int len = (r - l + 1) / 3;
            int le = l + len, ri = r - len;
            pair<int, int> tt = qmn(1, 1, m, le, ri);
            if(tt.first == m + 1){
                break;
            }
            int pos = tt.second;
            tim = tt.first;
            int nle = max(l, qmxpos(1, 1, m, l, le-1, tim));
            int nri = min(r, qmnpos(1, 1, m, ri+1, r, tim));
            if(pos - nle >= nri - pos){
                tie(l, r) = tie(nle, pos);
            } else {
                tie(l, r) = tie(pos, nri);
            }
        }
        int len = (r - l + 1) / 3;
        int le = l + len, ri = r - len;
        int nle = max(l, qmxpos(1, 1, m, l, le-1, m));
        int nri = min(r, qmnpos(1, 1, m, ri+1, r, m));
        tie(l, r) = tie(nle, nri);
        // printf("%d\n", qmxpos(1, 1, m, l, le-1, 0));
        printf("%d %d\n", l, r);
        for(auto j : dl[i]){
            // printf("add %d %d\n", j.second, m+1);
            add(1, 1, m, j.second, m + 1);
        }
    }
    return 0;
}