#include <bits/stdc++.h>

using ll = long long;
using namespace std;

#define int ll

#define rep(i, a) for (int i = 0; (i) < (int) (a); (i)++)
#define reps(i, a, b) for (int i = (int) (a); (i) < (int) (b); (i)++)
#define rrep(i, a) for (int i = (int) a-1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int) (a)-1; (i) >= (int) (b); (i)--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) sort(all(v));(v).erase(unique(all(v)), v.end())
#define CIN(type, x) type x;cin >> x
#define TRUE__  "Yes"
#define FALSE__ "No"
#define PRINT(f) if((f)){cout << (TRUE__) << endl;}else{cout << FALSE__ << endl;}
#define YES(f) if((f)){cout << "YES" << endl;}else{cout << "NO" << endl;}
#define Yes(f) if((f)){cout << "Yes" << endl;}else{cout << "No" << endl;}
#define MINV(v) min_element(all(v))
#define MAXV(v) max_element(all(v))
#define MIN3(a, b, c) min(min(a, b), c)
#define MIN4(a, b, c, d) min(MIN3(a, b, c), d)
#define MIN5(a, b, c, d, e) min(MIN4(a, b, c, d), e)
#define MIN6(a, b, c, d, e, f) min(MIN5(a, b, c, d, e), f)
#define MAX3(a, b, c) max(max(a, b), c)
#define MAX4(a, b, c, d) max(MAX3(a, b, c), d)
#define MAX5(a, b, c, d, e) max(MAX4(a, b, c, d), e)
#define MAX6(a, b, c, d, e, f) max(MAX5(a, b, c, d, e), f)
#define RANGE(a, b, c) ((a) <= (b) && (b) < (c))
#define RANGE2D(a, b, c, d, e, f) (RANGE((a), (c), (e)) && RANGE((b), (d), (f)))
#define chmin(a, b) a = min(a, (b))
#define chmin3(a, b, c) a = MIN3(a, (b), (c))
#define chmin4(a, b, c, d) a = MIN4(a, (b), (c), (d))
#define chmin5(a, b, c, d, e) a = MIN5(a, (b), (c), (d), (e))
#define chmin6(a, b, c, d, e, f) a = MIN6(a, (b), (c), (d), (e), (f))
#define chmax(a, b) a = max(a, (b))
#define chmax3(a, b, c) a = MAX3(a, (b), (c))
#define chmax4(a, b, c, d) a = MAX4(a, (b), (c), (d))
#define chmax5(a, b, c, d, e) a = MAX5(a, (b), (c), (d), (e))
#define chmax6(a, b, c, d, e, f) a = MAX6(a, (b), (c), (d), (e), (f))

#define RS resize
#define CINV(v, N) do {\
	v.RS(N);\
	rep(i, N) cin >> v[i];\
} while (0);

#define RCINV(v, N) do {\
	v.RS(N);\
	rrep(i, N) cin >> v[i];\
} while (0);
#define MOD 1000000007

template<class T>
inline T GET() {
	T x;
	cin >> x;
	return x;
}


void init();
void solve();

signed main()
{
	init();
	solve();
}

namespace mylib
{
template <typename T>
struct Matrix
{
	int row;
	int column;
	vector<vector<T>> v;
	vector<T> &operator[](int i) { return (v[i]); }
	Matrix(int i, int j)
	{
		init(i, j);
	}
	Matrix()
	{
		init(0, 0);
	}
	void init(int i, int j)
	{
		row = i;
		column = j;
		v.RS(i, vector<T>(j, 0));
	}
	Matrix(const Matrix &cp)
	{
		row = cp.row;
		column = cp.column;
		v = cp.v;
	}
	~Matrix()
	{
	}
	Matrix operator=(const Matrix &a)
	{
		row = a.row;
		column = a.column;
		v = a.v;
		return (*this);
	}

	Matrix operator+(const Matrix &a)
	{
		Matrix r(row, column);
		for (int i = 0; i < row; i++)
		{
			for (int j = 0; j < column; j++)
			{
				r.v[i][j] = v[i][j] + a.v[i][j];
			}
		}
		return (r);
	}

	Matrix operator-(const Matrix &a)
	{
		Matrix r(row, column);
		for (int i = 0; i < row; i++)
		{
			for (int j = 0; j < column; j++)
			{
				r.v[i][j] = v[i][j] - a.v[i][j];
			}
		}
		return (r);
	}
	Matrix operator*(const Matrix &a)
	{
		Matrix r(row, a.column);
		for (int i = 0; i < row; i++)
		{
			for (int j = 0; j < a.column; j++)
			{
				for (int k = 0; k < column; k++)
				{
					r.v[i][j] += v[i][k] * a.v[k][j];
				}
			}
		}
		return (r);
	}
	Matrix operator*(const int b)
	{
		Matrix r(row, column);
		for (int i = 0; i < row; i++)
		{
			for (int j = 0; j < column; j++)
			{
				r.v[i][j] = b * v[i][j];
			}
		}
		return (r);
	}
	void unit_matrix()
	{
		int n = row;
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < n; j++)
			{
				v[i][j] = 0;
				if (i == j)
					v[i][j] = 1;
			}
		}
	}

	Matrix transposed()
	{
		Matrix t(column, row);
		for (int i = 0; i < row; i++)
		{
			for (int j = 0; j < column; j++)
			{
				t[j][i] = v[i][j];
			}
		}
		return (t);
	}
};
template<typename T>
ostream &operator<<(ostream &lhs, const Matrix<T> &rhs)
{
	rep(i, rhs.row)
	{
		rep(j, rhs.column - 1)
		{
			lhs << rhs.v[i][j] << " ";
		}
		lhs << rhs.v[i][rhs.column - 1];
		if (i != rhs.row-1) cout << endl;
	}
	return lhs;
}
template<typename T>
istream &operator>>(istream &lhs, Matrix<T> &rhs)
{
	rep(i, rhs.row)
	{
		rep(j, rhs.column)
		{
			lhs >> rhs.v[i][j];
		}
	}
	return lhs;
}
}

using namespace mylib;

int N, M, Q;
Matrix<int> A, B;
Matrix<int> res;
Matrix<int> sum;

void init()
{
	cin >> N >> M >> Q;
	A.init(M, 2);
	B.init(Q, 2);
	cin >> A >> B;
	sum.init(N+1, N+1);
	res.init(Q, 1);
}

void solve()
{
	rep(i, M) {
		sum[A[i][0]][A[i][1]]++;
	}
	reps(i, 1, N+1) {
		reps(j, 1, N+1) {
			sum[i][j] += sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1];
		}
	}
	rep(i, Q) {
		res[i][0] = sum[B[i][0]-1][B[i][0]-1] + sum[B[i][1]][B[i][1]] - sum[B[i][1]][B[i][0]-1] - sum[B[i][0]-1][B[i][1]];
	}
	cout << res << endl;
}



Measured memory_bytes: 24832