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

alias Seg = Tuple!(int, "l", int, "r");
alias Query = Tuple!(int, "s", int, "t", int, "idx");

void main() {
    int n, m, q;
    scan(n, m, q);

    auto lcnt = new int[](n + 1);
    auto rcnt = new int[](n + 1);
    auto ss = new Seg[](m);

    foreach (i ; 0 .. m) {
        int li, ri;
        scan(li, ri);
        lcnt[li]++;
        rcnt[ri]++;
        ss[i] = Seg(li, ri);
    }

    foreach_reverse (i ; 0 .. n) {
        lcnt[i] += lcnt[i+1];
    }
    foreach (i ; 1 .. n + 1) {
        rcnt[i] += rcnt[i-1];
    }

    auto del = new int[](n + 1);

    auto qs = new Query[](m);

    foreach (i ; 0 .. q) {
        int si, ti;
        scan(si, ti);
        qs[i] = Query(si, ti, i);
    }

    ss.sort!"a.r > b.r"();
    qs.sort!"a.t > b.t"();

    int[] ans = new int[](q);
    int rr = n;

    foreach (i ; 0 .. q) {
        while (ss.front.r > qs[i].t) {
            del[ss.front.l]++;
            ss.popFront();
        }
        
        int res = lcnt[qs[i].s];
        foreach (j ; qs[i].s .. n + 1) {
            res -= del[j];
        }
        ans[qs[i].idx] = res;
    }

    writefln("%(%s\n%)", ans);
}






















void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    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);
        }
    }
}
