// UUID: 4de5bd18-5664-472b-9863-e9b53a5bc0ba
#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
// #pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

cout << fixed << setprecision(n);

set with custom ordering
set<ll, decltype(&cmp)> qu(cmp);

*/

typedef int64_t ll;

// offline, range max query
// means RMQ

class sparsetable{

    private:
        ll n;
		ll lim;
		vector<vector<ll>> v;
		const ll dummy = 0;
		vector<ll> tp;

	public:

		void init(ll size, vector<ll> inp) {

			n = size;
			lim = ceil(log2(n));
			tp.resize(lim+1, 0);
			tp[0] = 1;
			for(ll i = 1; i <= lim; i++) {
				tp[i] = tp[i-1] * 2;
			}

			v.resize(lim, vector<ll>(n, dummy));

			for(ll i = 0; i < n; i++) {
				v[0][i] = inp[i];
			}

			for(ll j = 1; j < lim; j++) {
				
				for(ll i = 0; i + tp[j] - 1 < n; i++) {
					v[j][i] = max(v[j-1][i], v[j-1][i + tp[j-1]]);
				}
			}

		}

		ll query(ll l, ll r) {

			ll len = r - l + 1;
			ll p = log2(len);

			ll ans = max(v[p][l], v[p][r - tp[p] + 1]);
			return ans;
		}

		void debug() {
			cerr << "\nn=" << n << "\nlim=" << lim;
			cerr << "\nv=" << v;
		}
};

void solve() {
	
	ll m, n, q;
	cin >> m >> n >> q;

	vector<ll> base(m+2, 0);
    for(ll i = 0; i < n; i++) {

		ll l, r;
		cin >> l >> r;
		base[l]++;
		base[r+1]--;
	}

	for(ll i = 1; i <= m; i++) {
		base[i] += base[i-1];
	}

	sparsetable rmq;
	rmq.init(m+1, base);
	
	//cerr << "\ndebug=";
	//rmq.debug();

	vector<ll> qr(q, 0);

	for(ll qi = 0; qi < q; qi++) {

		ll l, r;
		cin >> l >> r;

		ll ans = rmq.query(l, r);

		qr[qi] = ans;
	}

	for(ll i = 0; i < q; i++) {
		cout << qr[i] << "\n";
	}

}

int main()
{
	std::ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);

	solve();

	return 0;
}