#include <iostream>
//#include <fstream>

using namespace std;
struct Bencu{
    int ma;
    int hely;
}a[200010];

int helyre (int elso, int utolso) {
    int i=elso, j=utolso, p=elso;
    while (i<j) {
        if (a[i].ma<a[j].ma) {
            swap(a[i],a[j]);
            if (p==i) {
                p=j;
                i++;
            }
            else {
                p=i;
                j--;
            }
        }
        else {
            if (p==i) j--;
            else i++;
        }
    }
    return p;
}
void qsort (int elso, int utolso) {
    if (elso<utolso) {
        int p=helyre (elso,utolso);
        qsort(elso,p-1);
        qsort(p+1,utolso);
    }
}

int main()
{
    int m, n, q;
    //ifstream f("be.in");
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> m >> n >> q;
    for (int i = 1; i <= n; i++) {
        int x, y;
        cin >> x >> y;
        a[x].ma++;
        a[y+1].ma--;
    }
    //int t = a[1];
    for (int i = 2; i <= m; i++) {
        a[i].ma = a[i].ma+ a[i - 1].ma;
        a[i].hely=i;
    }
    //for (int i = 1; i <= m; i++) cout << a[i].ma << " ";
    //cout << endl;
    qsort(1,m);
    for (int t = 1; t <= q; t++) {
        int x, y;
        cin >> x >> y;
        /*int ma = a[x];
        for (int i = x + 1; i <= y; i++) {
            if (a[i] > ma) ma = a[i];
        }
        cout << ma << endl;*/
        int i=1;
        while (i<=m && (a[i].hely<x || a[i].hely>y)) i++;
        cout<<a[i].ma<<endl;
    }
    return 0;
}