#include <bits/stdc++.h>
#define REP(i,n) for (long long i=0;i<(n);i++)
#define FOR(i,a,b) for (long long i=(a);i<(b);i++)
#define RREP(i,n) for(long long i=n;i>=0;i--)
#define RFOR(i,a,b) for(long long i=(a);i>(b);i--)
#define dump1d_arr(array) REP(i,array.size()) cerr << #array << "[" << (i) << "] ==> " << (array[i]) << endl
#define dump2d_arr(array) REP(i,array.size()) REP(j,array[i].size()) cerr << #array << "[" << (i) << "]" << "[" << (j) << "] ==> " << (array[i][j]) << endl
#define dump(x)  cerr << #x << " => " << (x) << endl
#define dumpP(p) cerr << "( " << p.first << " , " << p.second << " )" << ends
#define SORT(c) sort((c).begin(),(c).end())
#define MIN(vec) *min_element(vec.begin(), vec.end())
#define MAX(vec) *max_element(vec.begin(), vec.end())
#define UNIQ(vec) vec.erase(unique(vec.begin(), vec.end()),vec.end()) //ソートの必要あり
#define IN(n,m)  (!(m.find(n) == m.end()))
#define ENUM(m) for (auto itr = m.begin(); itr != m.end(); ++itr)
#define dump_MAP(m) for(auto itr = m.begin(); itr != m.end(); ++itr) { cerr << itr->first << " --> "  << itr->second << endl; }
#define FINDL(vec,x) (lower_bound(vec.begin(),vec.end(),x) - vec.begin())
#define FINDU(vec,x) (upper_bound(vec.begin(),vec.end(),x) - vec.begin())
#define ROUND(N) setprecision(N)
#define ROUND_PRINT(N,val) cout << fixed;cout << setprecision(N) << val << endl
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define INARR(h,w,x,y) (0 <= y && y < h && 0 <= x && x < w)
#define EQ(a,b) (abs(a - b) < 1e-10)
using namespace std;
constexpr int dx[4] = {0,1,0,-1};
constexpr int dy[4] = {1,0,-1,0};
constexpr long double pi = M_PI;
constexpr double eps = 1e-10;
constexpr long mod = 1000000007;
constexpr short shINF = 32767;
constexpr long loINF = 2147483647;
constexpr long long llINF = 9223372036854775807;
typedef long long LL;
typedef vector<LL> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<long,long> pr;
typedef vector<bool> VB;
typedef vector<pr> VP;
typedef priority_queue<pr,vector<pr>,greater<pr>> pq;
typedef bitset<50000> bs;

int main(void) {
    cin.tie(0);
    ios::sync_with_stdio(false);
    long N,M,Q,p,q;
    cin >> N  >> M >> Q;
    VP lr(M);
    REP(i,M) cin >> lr[i].first >> lr[i].second;
    vector<bs> 
        accl1(N,bs(0)),accr1(N,bs(0)), // ~50000
        accl2(N,bs(0)),accr2(N,bs(0)), // 50000 ~ 100000
        accl3(N,bs(0)),accr3(N,bs(0)), // 100000 ~ 150000
        accl4(N,bs(0)),accr4(N,bs(0)); // 150000 ~ 200000

    REP(i,M) {
        if (i < 50000) {
            accl1[ (lr[i].first - 1) ].set(i);
            accr1[ (lr[i].second - 1 )].set(i);
        }
        else if ( 50000 <= i && i < 100000) {
            accl2[ (lr[i].first - 1) ].set((i-50000));
            accr2[ (lr[i].second - 1 )].set(i-50000);
        }
        else if ( 100000 <= i && i < 150000) {
            accl3[ (lr[i].first - 1) ].set(i-100000);
            accr3[ (lr[i].second - 1 )].set(i-100000);
        }
        else {
            accl4[ (lr[i].first - 1) ].set(i-150000);
            accr4[ (lr[i].second - 1 )].set(i-150000);
        }
    }

    REP(i,N-1) {
        accl1[N-i-2] |= accl1[N-i-1];
        accr1[i+1] |= accr1[i];
        accl2[N-i-2] |= accl2[N-i-1];
        accr2[i+1] |= accr2[i];
        accl3[N-i-2] |= accl3[N-i-1];
        accr3[i+1] |= accr3[i];
        accl4[N-i-2] |= accl4[N-i-1];
        accr4[i+1] |= accr4[i];
    }

    REP(i,Q) {
        cin >> p >> q;
        long ans = 
            (accl1[p-1] & accr1[q-1]).count() +
            (accl2[p-1] & accr2[q-1]).count() +
            (accl3[p-1] & accr3[q-1]).count() +
            (accl4[p-1] & accr4[q-1]).count();
        cout << ans << endl;
    }
}


Measured memory_bytes: 28544