{-# LANGUAGE BangPatterns #-}

import           Control.Monad
import qualified Data.IntMap   as M

main :: IO ()
main = do
  [n, m, k] <- readInts
  lrs <- replicateM m readInts
  pqs <- replicateM k readInts
  let !l_irmp = mkMap 1 lrs
  forM_ pqs (print . solve l_irmp)

readInts :: IO [Int]
readInts = map read . words <$> getLine

mkMap :: Int -> [[Int]] -> M.IntMap [(Int, Int)]
mkMap i []           = M.empty
mkMap i ([l, r]:lrs) = M.insertWith (++) l [(i, r)] $ mkMap (i + 1) lrs

solve :: M.IntMap [(Int, Int)] -> [Int] -> Int
solve l_irmp [p, q]
  = length
  $ filter (\(_, r) -> r <= q)
  $ concat
  $ M.elems
  $ M.filterWithKey (\l _ -> p <= l && l <= q) l_irmp
