#include <bits/stdc++.h>
using namespace std;
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
	#include <boost/multiprecision/cpp_int.hpp>
	#include <boost/multiprecision/cpp_dec_float.hpp>
	using bll = boost::multiprecision::cpp_int;
	using bdouble = boost::multiprecision::cpp_dec_float_100;
	using namespace boost::multiprecision;
#endif
#if __has_include(<boost/stacktrace.hpp>)
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE 1
	#include <boost/stacktrace.hpp>
#endif
#ifdef LOCAL_TEST
	namespace std {
		template<typename T> class dvector : public std::vector<T> {
		public:
			dvector() : std::vector<T>() {}
			explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
			dvector(const std::vector<T>& v) : std::vector<T>(v) {}
			dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
			dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::reverse_iterator first, const typename std::vector<T>::reverse_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_iterator first, const typename std::vector<T>::const_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_reverse_iterator first, const typename std::vector<T>::const_reverse_iterator last) : std::vector<T>(first, last) {}
			T& operator[](size_t n) {
				try { return this->at(n); } catch (const std::exception& e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n); }
			}
			const T& operator[](size_t n) const {
				try { return this->at(n); } catch (const std::exception& e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n); }
			}
		};
	}
	class dbool {
	private:
		bool boolvalue;
	public:
		dbool() : boolvalue(false) {}
		dbool(bool b) : boolvalue(b) {}
		operator bool&() { return boolvalue; }
		operator const bool&() const { return boolvalue; }
	};
	#define vector dvector
	#define bool dbool
#endif
#ifdef LOCAL_DEV
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<std::vector<T>>& vv) {
		s << "\\\n"; for (size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template <typename T, size_t N> std::ostream& operator<<(std::ostream& s, const std::array<T, N>& a) {
		s << "{ "; for (size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
		return s << "(" << p.first << ", " << p.second << ")"; }
	class SIGFPE_exception : std::exception {};
	class SIGSEGV_exception : std::exception {};
	void catch_SIGFPE([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception(); }
	void catch_SIGSEGV([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); }
	signed convertedmain();
	signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
	#define main() convertedmain()
	void debug_impl() { std::cerr << '\n'; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) do { std::cerr << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false)
#else
	#define debug(...) do {} while (false)
#endif
//#define int long long
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll dy[4] = {0, 1, 0, -1};
constexpr ll dx8[8] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr ll dy8[8] = {0, 1, 0, -1, 1, -1, 1, -1};
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define rrep(i, n)   for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n)  ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(std::vector<T>& v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline bool chmax(T& a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T& a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(std::vector<T>& v) { v.erase(std::unique(v.begin(), v.end()), v.end()); }

/*-----8<-----template-----8<-----*/

//クエリ区間に完全に含まれている区間の総和を求める
class IntervalContain {
public:
	struct Event{
		ll type, l, r, value;
		Event(ll type, ll l, ll r, ll value) : type(type), l(l), r(r), value(value) {}
	};
	bool compress;
	vector<ll> xs;
	ll bitsize = -1;
	vector<ll> bitdata;
	map<pair<ll,ll>,ll> ans;
private:
	ll getindex(const ll x) const {
		return lower_bound(begin(xs), end(xs), x) - begin(xs);
	}
	ll getvalue(const ll k) const {
		return xs[k];
	}
	ll bitsum(ll i) {
		ll ret = 0;
		for(--i; i>=0; i=(i&(i+1))-1) ret += bitdata[i];
		return ret;
	}
	ll bitsum(ll i, ll j) {
		return bitsum(j) - bitsum(i);
	}
	void bitadd(ll i, ll x) {
		for(; i < bitsize; i|=i+1) bitdata[i] += x;
	}
public:
	IntervalContain(vector<array<ll,3>> &range, vector<array<ll,2>> query, bool compress=false)
	 : compress(compress) {
		vector<Event> v;
		if(compress){
			for(auto&& ra:range){
				xs.push_back(ra[0]);
				xs.push_back(ra[1]);
			}
			for(auto&& q:query){
				xs.push_back(q[0]);
				xs.push_back(q[1]);
			}
			sort(begin(xs), end(xs));
			xs.erase(unique(begin(xs), end(xs)), end(xs));
			for(auto&& ra:range){
				v.emplace_back(0, getindex(ra[0]), getindex(ra[1]), ra[2]);
			}
			for(auto&& q:query){
				v.emplace_back(1, getindex(q[0]), getindex(q[1]), -1);
			}
			bitsize = xs.size();
		}else{
			for(auto&& ra:range){
				v.emplace_back(0, ra[0], ra[1], ra[2]);
				bitsize = max(bitsize, ra[1]+1);
			}
			for(auto&& q:query){
				v.emplace_back(1, q[0], q[1], -1);
				bitsize = max(bitsize, q[1]+1);
			}
		}
		bitdata.assign(bitsize, 0);
		sort(v.begin(), v.end(), [](const Event &x, const Event &y) {
			if(x.r != y.r) return x.r < y.r;
			if(x.type != y.type) return x.type < y.type;
			return x.l < y.l;
		});
		for(auto&& e:v){
			if(e.type == 0){
				bitadd(e.l, e.value);
			}else{
				ll l=e.l, r=e.r;
				if(compress) l=getvalue(l), r=getvalue(r);
				ans[{l, r}] = bitsum(e.l, e.r);
			}
		}
	}

	ll query(ll l, ll r) {
		return ans[{l,r}];
	}
};

/*-----8<-----library-----8<-----*/

void solve() {
	ll N,M,Q;
	cin >> N >> M >> Q;
	vector<array<ll,3>> range(M);
	rep(i,M){
		cin >> range[i][0] >> range[i][1];
		range[i][0]--;
		range[i][2] = 1;
	}
	vector<array<ll,2>> query(Q);
	rep(i,Q){
		cin >> query[i][0] >> query[i][1];
		query[i][0]--;
	}

	// [range[i][0], range[i][1]) の範囲に 値 range[i][2] を加算します
	// 投げる予定のクエリ [query[i][0], query[i][1]) を教える必要があります
	IntervalContain ic(range, query, true);
	//座圧不要な場合
	//IntervalContain ic(range, query, false);

	vector<ll> ans(Q,0);
	rep(i,Q){
		ll c = ic.query(query[i][0], query[i][1]);
		ans[i] = c;
	}
 
	rep(i,Q)p(ans[i]);
}

// https://atcoder.jp/contests/past201912-open/tasks/past201912_n
signed main() {
	solve();
	return 0;
}


Measured memory_bytes: 30952