from sys import stdin
input=stdin.readline

class SegmentTree:
    def __init__(self):
        self.tree = None
    def buildTree(self,List):
        n = len(List)
        self.tree = [0 for i in range(2*n)]
        for i in range(n):
            self.tree[i+n] = List[i]
        for i in range(n-1,0,-1):
            self.tree[i] = max(self.tree[i<<1],self.tree[i<<1 | 1])
    def maxInRange(self, left, right):
        n = len(self.tree)//2
        result = 0
        left += n
        right += n
        while left<right:
            if left&1:
                result = max(result, self.tree[left])
                left += 1
            if right&1:
                right -= 1
                result = max(result, self.tree[right])
            left >>= 1
            right >>= 1
        return result

def main():
    M,N,Q = [int(x) for x in input().split()]
    start=[0]*(M+1)
    end=[0]*(M+1)
    for i in range(N):
        A,B = [int(x) for x in input().split()]
        start[A]+=1
        end[B]+=1
    darab=[0]*(M+1)
    cur=0
    for i in range(1,M+1):
        cur+=start[i]
        darab[i]=cur
        cur-=end[i]
    segmentTree = SegmentTree()
    segmentTree.buildTree(darab)
    for i in range(Q):
        A,B = [int(x) for x in input().split()]
        print(segmentTree.maxInRange(A,B+1))
        
main()