class BIT:
    def __init__(self, n):
        self.size = n
        self.tree = [0]*(n+1)
 
    def build(self, list):
        self.tree[1:] = list.copy()
        for i in range(self.size+1):
            j = i + (i & (-i))
            if j < self.size+1:
                self.tree[j] += self.tree[i]

    def sum(self, i):
        # [0, i) の要素の総和を返す
        s = 0
        while i>0:
            s += self.tree[i]
            i -= i & -i
        return s
    # 0 index を 1 index に変更  転倒数を求めるなら1を足していく
    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.tree[i] += x
            i += i & -i

    # 総和がx以上になる位置のindex をbinary search
    def bsearch(self,x):
        le = 0
        ri = 1<<(self.size.bit_length()-1)
        while ri > 0:
            if le+ri <= self.size and self.tree[le+ri]<x:
                x -= self.tree[le+ri]
                le += ri
            ri >>= 1
        return le+1

n,k,q = map(int,input().split())
Q = [list(map(int,input().split())) for i in range(k)]
IX = [list(map(int,input().split())) for i in range(q)]

query = [[] for i in range(n+5)]
ans = [-1]*q
bit = BIT(k+5)

for i,(l,r,c,h) in enumerate(Q):
    query[l].append([0,h,i])
for ind,(i,x) in enumerate(IX):
    query[i].append([1,ind,x])
for i,(l,r,c,h) in enumerate(Q):
    query[r].append([0,-h,i])

for i in range(n+5):
    for id,x,y in query[i]:
        if id == 0:
            bit.add(y,x)
        else:
            ind = bit.bsearch(y)
            if ind > k + 1:
                continue
            ans[x] = Q[ind-1][2]
for i in ans:
    print(i)