#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 300'001;

int pref[MAXN], a[MAXN], tree[2*MAXN], n, m, q;

void upd(int u, int k) {
    tree[u += m] = k;
    for (u /= 2; u >= 1; u /= 2) {
        tree[u] = max(tree[2*u], tree[2*u+1]);
    }
}

int qry(int l, int r) {
    int res = 0; l += m; r += m;
    while (l <= r) {
        if (l % 2 == 1) res = max(res, tree[l++]);
        if (r % 2 == 0) res = max(res, tree[r--]);
        l /= 2; r /= 2;
    }
    return res;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> m >> n >> q;
    for (int i = 1; i <= n; i++) {
        int l, r; cin >> l >> r;
        pref[l]++;
        pref[r+1]--;
    }
    for (int i = 1; i <= m; i++) {
        pref[i] += pref[i-1];
        upd(i, pref[i]);
    }
    while (q--) {
        int l, r; cin >> l >> r;
        cout << qry(l, r) << "\n";
    }
    return 0;
}