import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

void scan(T...)(ref T args) {
    auto line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront;
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x > arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x < arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}



enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;


void main() {
    int N, M, Q;
    scan(N, M, Q);
    auto lr = new int[][](N, N);
    foreach (i ; 0 .. M) {
        int li, ri;
        scan(li, ri);
        li--, ri--;
        lr[li][ri]++;
    }
    auto cu = new int[][](N + 1, N + 1);
    foreach (i ; 1 .. N + 1) {
        foreach (j ; 1 .. N + 1) {
            cu[i][j] += cu[i-1][j] + cu[i][j-1] - cu[i-1][j-1] + lr[i-1][j-1];
        }
    }

    foreach (_ ; 0 .. Q) {
        int pi, qi;
        scan(pi, qi);
        auto ans = cu[N][qi] - cu[pi - 1][qi];
        writeln(ans);
    }
}
