#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;

int n, m, l[N], r[N], x[N], p[N];
vector<int> v[N];
int t[N * 4], cnt[N], pos[N];

#define ls (u << 1)
#define rs (u << 1 | 1)
inline void Build(int u, int a = 1, int b = m)
{
    t[u] = m + 1;
    if(a == b) pos[a] = u;
    else
    {
        int mid = (a + b) >> 1;
        Build(ls, a, mid);
        Build(rs, mid + 1, b);
    }
}
inline void Modify(int u)
{
    t[pos[u]] = cnt[u] ? m + 1 : p[u];
    cnt[u] ^= 1;
    for(u = pos[u] >> 1; u; u >>= 1) t[u] = min(t[ls], t[rs]);
}
inline int GetMin(int u, int x, int y, int a = 1, int b = m)
{
    if(x <= a && b <= y) return t[u];
    int res = m + 1, mid = (a + b) >> 1;
    if(x <= mid) res = GetMin(ls, x, y, a, mid);
    if(y > mid) res = min(res, GetMin(rs, x, y, mid + 1, b));
    return res;
}
inline int BinaryL(int u, int x, int y, int a = 1, int b = m)
{
    if(a == b) return t[u] < y ? a : 0;
    int mid = (a + b) >> 1, res = 0;
    if(mid < x && t[rs] < y) res = BinaryL(rs, x, y, mid + 1, b);
    if(res) return res;
    if(t[ls] < y) res = BinaryL(ls, x, y, a, mid);
    return res;
}
inline int BinaryR(int u, int x, int y, int a = 1, int b = m)
{
    if(a == b) return t[u] < y ? a : m + 1;
    int mid = (a + b) >> 1, res = m + 1;
    if(mid >= x && t[ls] < y) res = BinaryR(ls, x, y, a, mid);
    if(res != m + 1) return res;
    if(t[rs] < y) res = BinaryR(rs, x, y, mid + 1, b);
    return res;
}

inline void Work(int &l, int &r)
{
    while(1)
    {
        if(r - l <= 2)
        {
            if(r - l == 2 && cnt[l + 1]) r = l + 1;
            break ;
        }
        int ml = (l * 2 + r) / 3, mr = (l + r * 2 + 2) / 3;
        int s = GetMin(1, ml, mr), t = x[s];
        // printf("#%d %d %d %d %d %d\n", l, r, ml, mr, s, t);
        int p = BinaryL(1, ml - 1, s), q = BinaryR(1, mr + 1, s);
        l = max(l, p), r = min(r, q);
        if(s <= m)
        {
            if(t - l >= r - t) r = t;
            else l = t;
        }
        else break;
    }
}

int main()
{
    scanf("%d%d%*d", &n, &m);
    for(int i = 1; i <= n; i ++ ) scanf("%d%d", &l[i], &r[i]);
    for(int i = 1; i <= m; i ++ )
    {
        int l, r;
        scanf("%d%d%d", &x[i], &l, &r);
        p[x[i]] = i;
        v[l].push_back(x[i]);
        v[r + 1].push_back(x[i]);
    }
    Build(1);
    for(int i = 1; i <= n; i ++ )
    {
        for(int j : v[i]) Modify(j);
        Work(l[i], r[i]);
    }
    for(int i = 1; i <= n; i ++ ) printf("%d %d\n", l[i], r[i]);
    return 0;
}