 #include<iostream>
#include<string>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=550;

typedef long long ll;
int mp[N][N], dp[N][N];

int main()
{
    int n,m,q;
    cin>>n>>m>>q;

    while(m--)
    {
        int a,b;
        cin>>a>>b;
        mp[a][b] ++;
    }

    for(int i=n;i>=1;i--)
        for(int j=1; j<=n; j++)
        {
            dp[i][j] = mp[i][j] + dp[i+1][j] + dp[i][j-1] - dp[i+1][j-1];
            //printf("(%d,%d):%d\n",i,j,dp[i][j]);
        }

    while(q--)
    {
        int a,b;
        cin>>a>>b;
        cout<<dp[a][b]<<endl;
    }



    return 0;
}