import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N, M, Q;
    scan(N, M, Q);
    auto T = new long[][](N + 1, N + 1);
    foreach (_; 0 .. M)
    {
        long L, R;
        scan(L, R);
        T[L][R]++;
    }
    foreach (i; 0 .. N)
        T[i + 1][] += T[i][];
    foreach (i; 0 .. N)
        foreach (j; 0 .. N)
            T[i + 1][j + 1] += T[i + 1][j];
    foreach (_; 0 .. Q)
    {
        long p, q;
        scan(p, q);
        writeln(T[q][q] - T[q][p - 1] - T[p - 1][q] + T[p - 1][p - 1]);
    }
}
