#include <bits/stdc++.h>

using namespace std;

struct segTree{
    int meret = 1;
    vector<int> fa;

    void meretez(int n){
        while(meret < n){
            meret *= 2;
        }

        fa.assign(2 * meret - 1, 0);
    }

    int epit(int a, int b, int ind){
        if(a == b){
            return fa[ind];
        }

        int k = (a + b) / 2;
        return fa[ind] = max(epit(a, k, 2 * ind + 1), epit(k + 1, b, 2 * ind + 2));
    }

    int keres(int a, int b, int ind, int kezd, int veg){
        if(veg < a || b < kezd){
            return 0;
        } else if(kezd <= a && b <= veg){
            return fa[ind];
        }

        int k = (a + b) / 2;

        return max(keres(a, k, 2 * ind + 1, kezd, veg), keres(k + 1, b, 2 * ind + 2, kezd, veg));
    }
};

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int m, n, q;
    cin >> m >> n >> q;

    vector<int> helyek(m + 1);
    for(int i = 0; i < n; i++){
        int a, b;
        cin >> a >> b;
        a--;

        helyek[a]++;
        helyek[b]--;
    }

    segTree fa;
    fa.meretez(m);
    int akt = 0;
    for(int i = 0; i < m; i++){
        akt += helyek[i];
        fa.fa[i + fa.meret - 1] = akt;
    }

    fa.epit(0, fa.meret -1, 0);

    while(q--){
        int a, b;
        cin >> a >> b;
        a--; b--;

        cout << fa.keres(0, fa.meret - 1, 0, a, b) << "\n";
    }
}