#include <bits/stdc++.h>

using namespace std;

const int N = 500;

int n, m, q, c[N+7][N+7], f[N+7][N+7];

void dp() {
	for(int i = n; i >= 1; i--)
		for(int j = 1; j <= n; j++)
			f[i][j] = c[i][j]+f[i][j-1]+f[i+1][j]-f[i+1][j-1];
}

int main() {
	scanf("%d%d%d", &n, &m, &q);
	for(int i = 1, x, y; i <= m; i++) scanf("%d%d", &x, &y), c[x][y]++;
	dp();
	for(int i = 1, l, r; i <= q; i++) {
		scanf("%d%d", &l, &r);
		printf("%d\n", f[l][r]);
	}
	return 0;
}