#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::number<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 = (ll)1e9 + 7;//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<-----*/

template <class Integral, ::std::size_t Bitlength, Integral None>
class DynamicWaveletMatrix {
	static_assert(Bitlength > 0, "Bitlength must be greater than 0");

public:
	using value_type = Integral;
	using size_type = ::std::size_t;
	static constexpr value_type none = None;

private:
	class dynamic_fid {
		using u64 = ::std::uint_least64_t;
		using rank_type = ::std::uint_least8_t;
		using size_type = typename DynamicWaveletMatrix::size_type;
		static ::std::size_t popcount(u64 c) {
#ifdef __has_builtin
			return __builtin_popcountll(c);
#else
			c = (c & 0x5555555555555555ULL) + (c >> 1 & 0x5555555555555555ULL);
			c = (c & 0x3333333333333333ULL) + (c >> 2 & 0x3333333333333333ULL);
			c = (c + (c >> 4)) & 0x0F0F0F0F0F0F0F0FULL;
			return static_cast<::std::size_t>(c * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
		}
		class node_type {
		public:
			using u64 = typename dynamic_fid::u64;
			using rank_type = typename dynamic_fid::rank_type;
			using size_type = typename dynamic_fid::size_type;
			size_type left, right, size;
			u64 value;
			rank_type rank;
			node_type(const size_type s, const u64 f)
					: left(0), right(0), size(s), value(f), rank(0) {}
			u64 sum() const { return rank ? value : dynamic_fid::popcount(value); }
		};

		static u64 mask(const size_type i) noexcept {
			return (static_cast<u64>(1) << i) - 1;
		}

		::std::vector<node_type> c;
		size_type root;

		void fix(const size_type i) {
			c[i].size = c[c[i].left].size + c[c[i].right].size;
			c[i].value = c[c[i].left].sum() + c[c[i].right].sum();
			c[i].rank = ::std::max(c[c[i].left].rank, c[c[i].right].rank) + 1;
		}

	public:
		typename DynamicWaveletMatrix::value_type bit;
		dynamic_fid() : c({{0, 0}}), root(0), bit(0) {}
		void adjust_l(size_type &ptr) {
			if (c[c[ptr].left].rank == c[c[ptr].right].rank + 2) {
				size_type temp;
				if (c[c[c[ptr].left].left].rank + 1 != c[c[c[ptr].left].right].rank) {
					temp = c[ptr].left;
				} else {
					temp = c[c[ptr].left].right;
					c[c[ptr].left].right = c[temp].left;
					fix(c[ptr].left);
					c[temp].left = c[ptr].left;
				}
				c[ptr].left = c[temp].right;
				fix(ptr);
				c[temp].right = ptr;
				ptr = temp;
			}
			fix(ptr);
		}
		void adjust_r(size_type &ptr) {
			if (c[c[ptr].right].rank == c[c[ptr].left].rank + 2) {
				size_type temp;
				if (c[c[c[ptr].right].right].rank + 1 != c[c[c[ptr].right].left].rank) {
					temp = c[ptr].right;
				} else {
					temp = c[c[ptr].right].left;
					c[c[ptr].right].left = c[temp].right;
					fix(c[ptr].right);
					c[temp].right = c[ptr].right;
				}
				c[ptr].right = c[temp].left;
				fix(ptr);
				c[temp].left = ptr;
				ptr = temp;
			}
			fix(ptr);
		}
		void split_node(size_type pos) {
			size_type p = root, old = ~static_cast<size_type>(0);
			while (c[p].rank) {
				if (c[c[p].left].size > pos) {
					::std::swap(old, c[p].left);
				} else {
					pos -= c[c[p].left].size;
					::std::swap(old, c[p].right);
				}
				::std::swap(p, old);
			}
			const u64 bits = c[p].value;
			c[p].left = c.size();
			c.emplace_back(32, bits & mask(32));
			c[p].right = c.size();
			c.emplace_back(32, bits >> 32);
			c[p].value = popcount(bits);
			c[p].rank = 1;
			while (::std::swap(p, old), ~p) {
				if (!~c[p].left || c[c[p].left].rank > c[p].rank) {
					::std::swap(c[p].left, old);
					adjust_l(p);
				} else {
					::std::swap(c[p].right, old);
					adjust_r(p);
				}
			}
			root = old;
		}
		size_type insert(const size_type pos, const bool bit) {
			assert(pos <= size());
			size_type pos_ = pos, p = root, cnt = 0;
			while (++c[p].size, c[p].rank) {
				c[p].value += bit;
				if (c[c[p].left].size > pos_) {
					p = c[p].left;
				} else {
					pos_ -= c[c[p].left].size;
					cnt += c[c[p].left].sum();
					p = c[p].right;
				}
			}
			cnt += popcount(c[p].value & mask(pos_));
			c[p].value = (c[p].value & mask(pos_)) | (c[p].value >> pos_ << 1 | bit)
																								 << pos_;
			if (c[p].size == 64)
				split_node(pos);
			return cnt;
		}
		::std::pair<bool, size_type> erase(size_type pos) {
			assert(pos < size());
			size_type p = root, cnt = 0;
			const bool bit = operator[](pos);
			while (--c[p].size, c[p].rank) {
				c[p].value -= bit;
				if (c[c[p].left].size > pos) {
					p = c[p].left;
				} else {
					pos -= c[c[p].left].size;
					cnt += c[c[p].left].sum();
					p = c[p].right;
				}
			}
			cnt += popcount(c[p].value & mask(pos));
			c[p].value = c[p].value & mask(pos) | c[p].value >> pos + 1 << pos;
			return {bit, cnt};
		}
		size_type rank(size_type pos) const {
			assert(pos <= size());
			size_type p = root, cnt = 0;
			while (c[p].rank) {
				if (c[c[p].left].size > pos) {
					p = c[p].left;
				} else {
					pos -= c[c[p].left].size;
					cnt += c[c[p].left].sum();
					p = c[p].right;
				}
			}
			return cnt + popcount(c[p].value & mask(pos));
		}
		size_type cnt0() const { return c[root].size - c[root].sum(); }
		size_type size() const { return c[root].size; }
		bool operator[](size_type pos) const {
			assert(pos < size());
			size_type p = root;
			while (c[p].rank) {
				if (c[c[p].left].size > pos) {
					p = c[p].left;
				} else {
					pos -= c[c[p].left].size;
					p = c[p].right;
				}
			}
			return c[p].value >> pos & 1;
		}
	};
	::std::array<dynamic_fid, Bitlength> matrix;

	size_type at_least(size_type first, size_type last,
										 const value_type value) const {
		size_type ret = 0;
		for (const auto &v : matrix) {
			const size_type l = v.rank(first), r = v.rank(last);
			if (value & v.bit) {
				first = l + v.cnt0();
				last = r + v.cnt0();
			} else {
				ret += r - l;
				first -= l;
				last -= r;
			}
		}
		return ret + last - first;
	}

public:
	DynamicWaveletMatrix() : matrix() {
		value_type temp = static_cast<value_type>(1) << (Bitlength - 1);
		for (auto &v : matrix)
			v.bit = temp, temp >>= 1;
	}

	size_type size() const { return matrix[0].size(); }
	bool empty() const { return size() == 0; }

	value_type quantile(size_type first, size_type last, size_type k = 0,
											const value_type upper = none) const {
		if (upper != none)
			k += rangefreq(first, last, upper, none);
		if (last - first <= k)
			return none;
		value_type ret = 0;
		for (const auto &v : matrix) {
			const size_type l = v.rank(first), r = v.rank(last);
			if (r - l > k)
				first = l + v.cnt0(), last = r + v.cnt0(), ret |= v.bit;
			else
				first -= l, last -= r, k -= r - l;
		}
		return ret;
	}
	value_type rquantile(const size_type first, const size_type last,
											 size_type k = 0, const value_type lower = none) const {
		if (lower != none)
			k += rangefreq(first, last, none, lower);
		if (last - first <= k)
			return none;
		return quantile(first, last, last - first - k - 1, none);
	}
	size_type rangefreq(const size_type first, const size_type last,
											const value_type lower, const value_type upper) const {
		size_type ret = lower == none ? last - first : at_least(first, last, lower);
		return upper == none ? ret : ret - at_least(first, last, upper);
	}
	void insert(size_type position, const value_type value) {
		for (auto &v : matrix) {
			if (value & v.bit)
				position = v.cnt0() + v.insert(position, 1);
			else
				position -= v.insert(position, 0);
		}
	}
	value_type erase(size_type position) {
		value_type ret = 0;
		for (auto &v : matrix) {
			const auto temp = v.erase(position);
			if (temp.first)
				position = v.cnt0() + temp.second, ret |= v.bit;
			else
				position -= temp.second;
		}
		return ret;
	}
	value_type replace(const size_type index, const value_type value) {
		const value_type ret = erase(index);
		insert(index, value);
		return ret;
	}
};

/*-----8<-----library-----8<-----*/
 
void solve() {
	ll N,M,Q;
	cin >> N >> M >> Q;
	vector<pair<ll,ll>> v;
	rep(i,M){
		ll t1,t2;
		cin >> t1 >> t2;
		t1--;t2--;
		//{t1,t2}に1を加算
		v.emplace_back(t1,t2);
	}

	sort(all(v));

	const ll bitlength = 1 + log2(1e9);
	DynamicWaveletMatrix<ll,bitlength,0LL> dwm;
	rep(i,v.size())dwm.insert(i, v[i].second);
 
	vector<ll> ans(Q,0);
	rep(i,Q){
		ll t1,t2;
		cin >> t1 >> t2;
		t1--;//t2--;
		auto itx = lower_bound(v.begin(), v.end(), pair<ll,ll>(t1,0), [](const pair<ll,ll> &x, const pair<ll,ll>& y) {
			return x.first < y.first;
		});
		ll x=itx-v.begin();
		auto ity = lower_bound(v.begin(), v.end(), pair<ll,ll>(t2,0), [](const pair<ll,ll> &x, const pair<ll,ll>& y) {
			return x.first < y.first;
		});
		ll y=ity-v.begin();

		ll c=dwm.rangefreq(x, y, t1, t2);
		ans[i]=c;
	}

	rep(i,Q)p(ans[i]);

}

signed main() {
	solve();
	return 0;
}


Measured memory_bytes: 25576