// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<

// >>> segment tree 2d
template <class Handler>
struct Segtree2D : Handler {
    using Value = typename Handler::Value;
    using Handler::unit; // () -> Value
    using Handler::merge; // (Value,Value) -> Value

    vector<vector<Value>> v;
    int n,m;
    Segtree2D() {}
    Segtree2D(int n, int m, Value const& x = unit())
        : v(2*n,vector<Value>(2*m,x)),n(n),m(m) {}
    void set(int i, int j, Value const& val) {
        assert(0 <= i); assert(i < n);
        assert(0 <= j); assert(j < m);
        for (int x = n+i; x; x >>= 1) {
            int y = m+j;
            v[x][y] = (x < n ? merge(v[x<<1][y], v[(x<<1)|1][y]) : val);
            for (y >>= 1 ; y; y >>= 1) {
                v[x][y] = merge(v[x][y<<1], v[x][(y<<1)|1]);
            }
        }
    }
    Value get(int i, int j) const {
        assert(0 <= i); assert(i < n);
        assert(0 <= j); assert(j < m);
        return v[n+i][m+j];
    }
    Value get(int xl, int xr, int yl, int yr) const {
        assert(0 <= xl); assert(xl <= xr); assert(xr <= n);
        assert(0 <= yl); assert(yl <= yr); assert(yr <= m);
        Value val = unit();
        for (xl += n, xr += n; xl < xr; xl >>= 1, xr >>= 1) {
            if (xl&1) {
                for (int l = m+yl, r = m+yr; l < r; l >>= 1, r >>= 1) {
                    if (l&1) val = merge(val, v[xl][l++]);
                    if (r&1) val = merge(v[xl][--r], val);
                }
                ++xl;
            }
            if (xr&1) {
                --xr;
                for (int l = m+yl, r = m+yr; l < r; l >>= 1, r >>= 1) {
                    if (l&1) val = merge(val, v[xr][l++]);
                    if (r&1) val = merge(v[xr][--r], val);
                }
            }
        }
        return val;
    }
    vector<vector<Value>> dat() const {
        vector<vector<Value>> ret(n,vector<Value>(m));
        rep (i,n) rep (j,m) ret[i][j] = get(i,j);
        return ret;
    }
};
// <<<

struct RangeSum {
    using Value = int;
    constexpr static Value unit() { return 0; }
    constexpr static Value merge(Value x, Value y) { return x+y; }
};

int32_t main() {
    int n,m,q; cin >> n >> m >> q;
    vector<int> L(m),R(m),x(q),y(q);
    rep (i,m) cin >> L[i] >> R[i];
    rep (i,q) cin >> x[i] >> y[i];

    Segtree2D<RangeSum> seg(n+1,n+1);
    dump(as_mat(seg.dat()));
    rep (i,m) {
        dump(i,L[i],R[i]);
        seg.set(L[i],R[i],1+seg.get(L[i],R[i]));
        dump(as_mat(seg.dat()));
    }

    rep (i,q) cout << seg.get(x[i],n+1,0,y[i]+1) << "\n";


}


Measured memory_bytes: 13568