import Data.List
import Control.Monad

data KdTree = Branch {isBegBrch :: {-# UNPACK #-} !Bool,
                      pivotBeg :: {-# UNPACK #-} !Int,
                      pivotEnd :: {-# UNPACK #-} !Int,
                      size_ :: {-# UNPACK #-} !Int
                      leftChild :: KdTree,
                      rightChild :: KdTree } | Nil

size :: KdTree -> Int
size Branch@{size_ = s} = s
size Nil = 0
                                               
pivot (Branch _ b e _ _ _) = (b,e)

branch :: Bool -> (Int,Int) -> KdTree -> KdTree -> KdTree
branch b (pb,pe) lc rc = Branch b pb pe (size lc + size rc + 1) lc rc

selector :: Bool -> (a,a) -> a
selector True = fst
selector False = snd

makeKdTree_ :: Bool -> [(Int,Int)] -> Int -> KdTree
makeKdTree_ _ [] = Nil
makeKdTree_ flag ls len = Branch flag pb pe len
                                           (makeKdTree_ (not flag) ls1 len1)
                                           (makeKdTree_ (not flag) ls2 len2)
 where
   ls' = sortOn (selector flag)
   (ls1, (pb,pe):ls2) = splitAt len1 ls 
   len1 = len `div` 2
   len2 = len - len1 - 1

makeKdTree :: [(Int,Int)] -> KdTree
makeKdTree ls = makeKdTree_ True ls (length ls)

query :: (Bool,Bool) -> KdTree -> (Int,Int) -> Int
query _ Nil _ = 0
query (True,True) b _ = size b
query (True,False) (b@(Branch True _ pe _ lc rc)) t@(_,te)
  = (if pe <= te then 1 else 0)
     + query (True,False) lc t
     + query (True,False) rc t
query (False,True) (b@(Branch False _ pe _ lc rc)) t@(tb,_)
   = (if tb <= pb then 1 else 0)
     + query (False,True) lc t
     + query (False,True) rc t
query (False,flg2) (b@(Branch True pb pe _ lc rc)) t@(tb,te)
   = if tb <= pb
     then
       (if pe <= te then 1 else 0)
       + query (False,flg2) lc t
       + query (True,flg2) rc t
     else
       query (False,flg2) rc t
query (flg1,False) (b@(Branch False pb pe _ lc rc)) t@(tb,te)
   = if pe <= te
     then
       (if tb <= pb then 1 else 0)
       + query (flg1,True) lc t
       + query (flg1,False) rc t
     else
       query (flg1,False) lc t

main :: IO ()
main = do
  [n,m,q] <- (map read . words) <$> getLine
  ls <- map ((\[x,y]->(x,y)) . map read . words) <$> replicateM m getLine
  let tr = makeKdTree ls
  replicateM q $ do
    t <- ((\[x,y]->(x,y)) . map read . words) <$> getLine
    let a = query (False,False) tr t
    putStrLn $ show a