#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=509;
ll dp[N][N];
int n,M,Q;
int main()
{
cin>>n>>M>>Q;
for(int i=1;i<=M;i++)
{
int l,r;cin>>l>>r;
dp[l][r]++;
}
for(int len=2;len<=n;len++)
{
for(int l=1;l+len-1<=n;l++)
{
int r=len+l-1;
dp[l][r]+=dp[l+1][r]+dp[l][r-1]-dp[l+1][r-1];
}
}
while(Q--)
{
int l,r;cin>>l>>r;
cout<<dp[l][r]<<endl;
}
return 0;
}