#include <iostream>
#include <algorithm>
#include <set>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 3e5 + 10;

int n, m, q, ans[MAXN];

struct Data
{
    int x, t, c;
    bool operator < (const Data u) const {return t < u.t;}
}a[MAXN << 1], qt[MAXN];
int tot, b[MAXN << 2];

multiset <int> st[MAXN];

multiset <int> nd[MAXN * 12];
int tr[MAXN * 12];
inline void Pushup(int cur) {tr[cur] = min(tr[cur << 1], tr[cur << 1 | 1]);}
void Update(int cur, int l, int r, int x, int k, bool tp)
{
    if (l == r) (tp ? nd[cur].erase(nd[cur].find(k)) : nd[cur].insert(k)), tr[cur] = (nd[cur].size() ? *nd[cur].begin() : 2e9);
    else
    {
        int mid = l + r >> 1;
        if (x <= mid) Update(cur << 1, l, mid, x, k, tp);
        else Update(cur << 1 | 1, mid + 1, r, x, k, tp);
        Pushup(cur);
    }
}
int Query(int cur, int l, int r, int x, int y)
{
    if (x <= l && r <= y) return tr[cur];
    int mid = l + r >> 1, ans = 2e9;
    if (x <= mid) ans = min(ans, Query(cur << 1, l, mid, x, y));
    if (y > mid) ans = min(ans, Query(cur << 1 | 1, mid + 1, r, x, y));
    return ans;
}

int main()
{
    // freopen("A.in", "r", stdin);
    // freopen("A.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(m), Read(q);
    for (int i = 1, x, c, l, r; i <= n; i++)
    {
        Read(x), Read(c), Read(l), Read(r);
        a[++tot] = Data{x, l, c}, a[++tot] = Data{x, r + 1, -c};
    }
    n = tot;
    for (int i = 1; i <= q; i++) Read(qt[i].x), Read(qt[i].t), qt[i].c = i;
    sort(qt + 1, qt + q + 1), sort(a + 1, a + n + 1);
    tot = 0;
    for (int i = 1; i <= n; i++) b[++tot] = a[i].x;
    for (int i = 1; i <= q; i++) b[++tot] = qt[i].x;
    sort(b + 1, b + tot + 1), tot = unique(b + 1, b + tot + 1) - b - 1;
    for (int i = 1; i <= n; i++) a[i].x = lower_bound(b + 1, b + tot + 1, a[i].x) - b;
    for (int i = 1; i <= (tot << 2); i++) tr[i] = 2e9;
    b[++tot] = 2e9;
    for (int i = 1; i <= m; i++)
        st[i].insert(tot), Update(1, 1, tot, tot, -2e9, 0);

    // for (int i = 1; i <= tot; i++) cout << b[i] << ' '; cout << '\n';

    for (int i = 1, j = 1; i <= q; i++)
    {
        while (j <= n && a[j].t <= qt[i].t)
        {
            if (a[j].c > 0)
            {
                auto it = st[a[j].c].upper_bound(a[j].x); 
                int pre = -2e9, nxt = 2e9;
                if (it != st[a[j].c].end()) nxt = *it;
                if (it != st[a[j].c].begin()) pre = *prev(it);
                if (nxt != 2e9) Update(1, 1, tot, nxt, pre, 1), Update(1, 1, tot, nxt, a[j].x, 0);
                Update(1, 1, tot, a[j].x, pre, 0);
                // cout << a[j].x << ' ' << pre << ' ' << nxt << '\n';
                st[a[j].c].insert(a[j].x);
            }
            else
            {
                a[j].c = -a[j].c;
                auto it = st[a[j].c].upper_bound(a[j].x);
                int pre = -2e9, nxt = 2e9;
                if (it != st[a[j].c].end()) nxt = *it;
                if (--it != st[a[j].c].begin()) pre = *prev(it);
                if (nxt != 2e9) Update(1, 1, tot, nxt, a[j].x, 1), Update(1, 1, tot, nxt, pre, 0);
                Update(1, 1, tot, a[j].x, pre, 1);
                st[a[j].c].erase(it);
            }
            j++;
        }
        int l = 0, r = 1e8, mid, res = -1, p, cur;
        while (l <= r)
        {
            mid = l + r >> 1;
            p = upper_bound(b + 1, b + tot + 1, qt[i].x + mid) - b;
            cur = Query(1, 1, tot, p, tot);
            // cout << qt[i].x << ' ' << p << ' ' << cur << ' ' << mid << '\n';
            if (cur == -2e9 || b[cur] < qt[i].x - mid) l = mid + 1;
            else res = mid, r = mid - 1;
        }
        ans[qt[i].c] = res;
    }
    for (int i = 1; i <= q; i++) cout << ans[i] << '\n';
    return 0;
}