// Original C++ solution (slower):
#include <iostream>

#include <vector>

#include <utility>

#include <numeric>

#include <functional>

#include <stdio.h>

#include <math.h>

#include <string>

#include <algorithm>

#include <deque>

#include <queue>

#include <map>



#define rep(i, m, n) for (int (i)(m); (i)<(n); ++(i))

#define repr(i, m, n) for (int (i)(m - 1); (i)>=(n); --(i))

#define repv(i, v) for (unsigned (i)(0); (i)<(v.size()); ++(i))

#define all(v) (v).begin(), (v).end()

#define sortv(v) sort(all(v))

#define sortgi(v) sort(all(v), greater<int>())

#define sortgd(v) sort(all(v), greater<double>())

#define sortgll(v) sort(all(v), greater<ll>())

#define debug(x) cerr << #x << ": " << x << '\n'



using namespace std;

using pii = pair<int, int>;

using pss = pair<string, string>;

using vi = vector<int>;

using vvi = vector<vi>;

using vvvi = vector<vvi>;

using vd = vector<double>;

using vvd = vector<vd>;

using vs = vector<string>;

using ll = long long;

using pllll = pair<ll, ll>;

using vll = vector<ll>;

using vvll = vector<vll>;

using vb = vector<bool>;

using vvb = vector<vb>;

using vvvb = vector<vvb>;

using vpii = vector<pii>;

using pqi = priority_queue<int>;

using pqd = priority_queue<double>;

using pqll = priority_queue<ll>;

using pqvi = priority_queue<vi>;

using pqvll = priority_queue<vll>;



int main() {

	int N, M, Q;

	cin >> N >> M >> Q;

	int LR[1000][1000];

	int al[M];

	int ar[M];

	rep(i, 0, M) {

		int l, r;

		cin >> l >> r;

		al[i] = l;

		ar[i] = r;

	}

	int ap[Q];

	int aq[Q];

	rep(i, 0, Q) {

		int p, q;

		cin >> p >> q;

		ap[i] = p;

		aq[i] = q;

	}

	rep(i, 0, M) {

		for(int j = 1; j <= al[i]; ++j) {

			for (int k = ar[i]; k <= N; ++k) {

				++LR[j][k];

			}

		}

	}

	vi v(0);

	rep(i, 0, Q) {

		v.push_back(LR[ap[i]][aq[i]]);

	}

	repv(i, v) {

		cout << v[i] << endl;

	}

}


// Optimized solution to the same problem (faster):
#include <iostream>

#include <vector>

#include <utility>

#include <numeric>

#include <functional>

#include <stdio.h>

#include <math.h>

#include <string>

#include <algorithm>

#include <deque>

#include <queue>

#include <map>



#define rep(i, m, n) for (int (i)(m); (i)<(n); ++(i))

#define repr(i, m, n) for (int (i)(m - 1); (i)>=(n); --(i))

#define repv(i, v) for (unsigned (i)(0); (i)<(v.size()); ++(i))

#define all(v) (v).begin(), (v).end()

#define sortv(v) sort(all(v))

#define sortgi(v) sort(all(v), greater<int>())

#define sortgd(v) sort(all(v), greater<double>())

#define sortgll(v) sort(all(v), greater<ll>())

#define debug(x) cerr << #x << ": " << x << '\n'



using namespace std;

using pii = pair<int, int>;

using pss = pair<string, string>;

using vi = vector<int>;

using vvi = vector<vi>;

using vvvi = vector<vvi>;

using vd = vector<double>;

using vvd = vector<vd>;

using vs = vector<string>;

using ll = long long;

using pllll = pair<ll, ll>;

using vll = vector<ll>;

using vvll = vector<vll>;

using vb = vector<bool>;

using vvb = vector<vb>;

using vvvb = vector<vvb>;

using vpii = vector<pii>;

using pqi = priority_queue<int>;

using pqd = priority_queue<double>;

using pqll = priority_queue<ll>;

using pqvi = priority_queue<vi>;

using pqvll = priority_queue<vll>;



int lr[1000][1000];



int main() {

	int N, M, Q;

	scanf("%d %d %d", &N, &M ,&Q);

	rep(i, 0, M) {

		int l, r;

		scanf("%d %d", &l, &r);

		++lr[l][r];

	}

	rep(i, 1, N + 1) {

		rep(j, 1, N + 1) {

			lr[i][j] += lr[i][j - 1]; 

		}

	}

	rep(i, 1, N + 1) {

		rep(j, 1, N + 1) {

			lr[j][i] += lr[j - 1][i]; 

		}

	}

	rep(i, 0, Q) {

		int p, q;

		scanf("%d %d", &p, &q);

		printf("%d\n", lr[q][q] - lr[p-1][q] - lr[q][p-1] + lr[p-1][p-1]);

	}

}


// Fastest known solution for this problem: