output_description: Print Q lines. The i-th line should contain the number of the trains that runs
  **strictly within** the section from City p_i to City q_i.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N M Q
      L_1 R_1
      L_2 R_2
      :
      L_M R_M
      p_1 q_1
      p_2 q_2
      :
      p_Q q_Q
attempt: #include<iostream>
  #include<algorithm>
  #include<math.h>
  #include<queue>
  #include<string>
  #include<vector>
  #include<stack>
  #include<iomanip>
  #include<map>
  #define rep(i,n) for(int i=0;i<((int)n);i++)
  #define drep(i,n) for(int i=((int)n)-1;i>-1;i--)
  #define Rep(i,n0,n) for(int i=n0;i<((int)n);i++)
  #define Com(i,j,n) for(int i=0;i<n-1;i++)for(int j=i+1;j<((int)n);j++)
  #define W(x) cout<<x<<endl;
  #define Debug(x) cout<<"#DEBUG "<<x<<endl;
  #define INF (1<<29)
  #define INF2 (long long)8*(long long)INF*(long long)INF
  #define mod 1000000007
  
  typedef long long ll;
  
  using namespace std;
  
  
  int min(int x,int y){if(y<x)return y;else return x;}
  int max(int x,int y){if(y>x)return y;else return x;}
  int fact(int x){int i=1;rep(j,x){i*=(j+1);} return i;}
  long long fact(long long x){long long i=1;rep(j,x){i*=(j+1);} return i;}
  int gcd(int x, int y){if(x%y==0)return y;else if(y%x==0)return x;else return gcd(x%y,y%x);}
  ll gcd(ll x, ll y){if(x%y==0)return y;else if(y%x==0)return x;else return gcd(x%y,y%x);}
  void say(bool x){if(x){cout<<"Yes"<<endl;}else {cout<<"No"<<endl;}return;}
  
  int dd[500][500];
  int main()
  {
      int n,m,Q;
      cin >>n >>m >>Q;
      int l,r;
      rep(i,m)
      {
          cin>>l>>r;
          l--;
          r--;
          dd[l][r]++;
      }
      rep(i,n)
      {
          rep(j,n-1)
          {
              dd[i][j+1]+=dd[i][j];
          }
      }
      rep(i,n)
      {
          drep(j,n-1)
          {
              dd[j][i]+=dd[j+1][i];
          }
      }
      int p,q;
      rep(i,Q)
      {
          cin>>p>>q;
          p--;
          q--;
          W(dd[p][q])
      }
      return 0;
  }
problem_description: Statement
  
  In Takahashi Kingdom, there is a east-west railroad and N cities along it,
  numbered 1, 2, 3, ..., N from west to east. A company called _AtCoder Express_
  possesses M trains, and the train i runs from City L_i to City R_i (it is
  possible that L_i = R_i). Takahashi the king is interested in the following Q
  matters:
  
    * The number of the trains that runs **strictly within** the section from City p_i to City q_i, that is, the number of trains j such that p_i \leq L_j and R_j \leq q_i.
  
  Although he is genius, this is too much data to process by himself. Find the
  answer for each of these Q queries to help him.
samples: [{"input": "2 3 1\n    1 1\n    1 2\n    2 2\n    1 2", "output": "3\n    \n\nAs all the trains runs within the section from City 1 to City 2, the answer to\nthe only query is 3.\n\n* * *"}, {"input": "10 3 2\n    1 5\n    2 8\n    7 10\n    1 7\n    3 10", "output": "1\n    1\n    \n\nThe first query is on the section from City 1 to 7. There is only one train\nthat runs strictly within that section: Train 1. The second query is on the\nsection from City 3 to 10. There is only one train that runs strictly within\nthat section: Train 3.\n\n* * *"}, {"input": "10 10 10\n    1 6\n    2 9\n    4 5\n    4 7\n    4 7\n    5 8\n    6 6\n    6 7\n    7 9\n    10 10\n    1 8\n    1 9\n    1 10\n    2 8\n    2 9\n    2 10\n    3 8\n    3 9\n    3 10\n    1 10", "output": "7\n    9\n    10\n    6\n    8\n    9\n    6\n    7\n    8\n    10"}]