#include <bits/stdc++.h>
using namespace std;

vector<int>t;

void build(vector<int>&a, int v, int tl, int tr)
{
    if(tl == tr) t[v] = a[tl];
    else
    {
        int tm = (tl+tr) / 2;
        build(a, v*2, tl, tm);
        build(a, v*2+1, tm+1, tr);
        t[v] = max(t[v*2], t[v*2+1]);
    }
}

int query(int v, int tl, int tr, int l, int r)
{
    if(l > r) return 0;
    if(tl == l && tr == r) return t[v];
    int tm = (tl+tr) / 2;
    return max(query(v*2, tl, tm, l, min(tm, r)), query(v*2+1, tm+1, tr, max(tm+1, l), r));
}

signed main() {
    ios::sync_with_stdio(false);cin.tie(nullptr);
	int n, m, q; cin >> n >> m >> q;
    vector<pair<int, int>>a(m);
    vector<int>tin;
    for(auto &[i, j] : a)
    {
        cin >> i >> j;
        tin.push_back(i);
        tin.push_back(j);
    }
    vector<pair<int, int>>qr(q);
    for(auto &[i, j] : qr)
    {
        cin >> i >> j;
        tin.push_back(i);
        tin.push_back(j);
    }
    t.resize(4*n);
    vector<int>cnt(n+2);
    for(auto [i, j] : a)
    {
        cnt[i]++;
        cnt[j+1]--;
    }
    int k = 0;
    for(int i = 1; i <= n; i++)
    {
        k += cnt[i];
        cnt[i] = k;
    }
    build(cnt, 1, 1, n);
    for(auto [l, r] : qr)
    {
        cout << query(1, 1, n, l, r) << '\n';
    }
}