#include <iostream>
#include <queue>
#include <algorithm>
#define ll long long
using namespace std;
ll n, m,q;

vector<ll>x,st;

void epit(ll p, ll l, ll r) {
    if (l == r)	{
        st[p] = x[l];
        return;
    }
    ll k = (l + r) / 2;
    epit(2*p, l, k);
    epit(2*p+1, k + 1, r);
    st[p] = max(st[2 * p], st[2 * p + 1]);
}
ll leker(ll p, ll l, ll r, ll a, ll b) {
    if (a <= l && r <= b) {
        return st[p];
    }
    else if (b < l || r < a)return 0;

    ll k = (l + r) / 2;
    return max(leker(2 * p, l, k, a, b), leker(2 * p + 1, k + 1, r, a, b));
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> m >> n >> q;
    x.resize(m + 2);
    st.resize(4 * m + 1);
    for (int i = 1; i <= n; i++)
    {
        ll a, b;
        cin >> a >> b;
        x[a]++;
        x[b + 1]--;

    }
    for (int i = 1; i <= m; ++i)
    {
        x[i] += x[i - 1];
    }
    epit(1, 1, m);
    for (int i = 1; i <= q; ++i)
    {
        ll a, b;
        cin >> a >> b;
        cout<<leker(1, 1, m, a, b)<<"\n";
    }

    return 0;
}