import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

from collections import defaultdict

def add(i, a):
    i += 1
    while i <= n:
        bit[i] += a
        i += i & -i

def cumsum(i):
    res = 0
    i += 1
    while i > 0:
        res += bit[i]
        i -= i & -i
    return res

n, k, q = LI()
lrch = []
for _ in range(k):
    l, r, c, h = LI()
    lrch.append((l-1, r, c, h))
itox = defaultdict(list)

for qi in range(q):
    i, x = LI()
    i -= 1
    itox[i].append((x, qi))

for i in itox:
    itox[i].sort(key=lambda x: -x[0])

p = round(k**0.5)
ans = [-1]*q
bit = [0]*(n+1)
pre = [0]*(n+1)
for ti, (l, r, c, h) in enumerate(lrch):
    add(l, h)
    add(r, -h)
    if ti%p == p-1 or ti == k-1:
        deli = []
        for i in itox.keys():
            s = cumsum(i)
            if s >= itox[i][-1][0]:
                x, qi = itox[i].pop()
                if not itox[i]: deli.append(i)
                for j in range(ti, -1, -1):
                    pl, pr, pc, ph = lrch[j]
                    if pl <= i < pr: s -= ph
                    if s < x:
                        ans[qi] = pc
                        break
        for i in deli: del itox[i]

for a in ans: print(a)