import std.stdio, std.conv, std.string;
import std.algorithm, std.array, std.container;
import std.numeric, std.math;
import core.bitop;

T RD(T = string)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }

long mod = pow(10, 9) + 7;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD!long;
	auto M = RD!long;
	auto Q = RD!long;

	auto table = new long[][](N+1, N+1);
	foreach (i; 0..M)
	{
		auto L = RD!long;
		auto R = RD!long;
		++table[L][R];
	}

	auto dp = new long[][](N+2, N+2);
	foreach_reverse (i; 1..N+1)
	{
		foreach (j; i..N+1)
		{
			dp[i][j] = dp[i][j-1] + dp[i+1][j] - dp[i+1][j-1] + table[i][j];
		}
	}

	string[] ans;
	foreach (i; 0..Q)
	{
		auto p = RD!long;
		auto q = RD!long;
		ans ~= to!string(dp[p][q]);
	}
	foreach (e; ans) writeln(e);

	stdout.flush();
}