#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#define pb push_back
using namespace std;

const int N = 3e3 + 5, M = 2 * N;

int n, m, Q, s, q[N], dep[N], fa[N], sz[N], dfn[N], dfncnt, ban, c[N];

bool st[N][N], vis[N];

int head[N], numE = 0;

struct E{
	int next, v;
} e[M];

void inline add(int u, int v) {
	e[++numE] = (E) { head[u], v };
	head[u] = numE;
}

void dfs(int u) {
	st[s][u] = false;
	for (int i = head[u]; i; i = e[i].next) {
		int v = e[i].v;
		if (v != s && st[s][v]) dfs(v);
	}
}

vector<int> g[N], g2[N];

int cnt[N];

void inline build() {
	int hh = 0, tt = 0;
	q[0] = 1;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			if (st[i][j]) cnt[j]++;
	while (hh <= tt) {
		int u = q[hh++];
		for (int v = 1; v <= n; v++) {
			if (!st[u][v]) continue;
			st[u][v] = false, cnt[v]--; 
			if (cnt[v] == 1) g[u].pb(v), q[++tt] = v;
		}
	}
}

void dfs2(int u) {
	dfn[u] = ++dfncnt;
	sz[u] = 1;
	for (int i = 0; i < g[u].size(); i++) {
		int v = g[u][i];
		if (v == fa[u]) continue;
		fa[v] = u, dep[v] = dep[u] + 1;
		dfs2(v);
		sz[u] += sz[v];
	}
}

int inline lca(int x, int y) {
	while (x != y) {
		if (dep[x] < dep[y]) swap(x, y);
		x = fa[x];
	}
	return x;
}

void dfs3(int u) {
	st[s][u] = 1;
	for (int i = 0; i < g2[u].size(); i++) {
		int v = g2[u][i];
		if (v == ban) continue;
		if (!st[s][v]) dfs3(v);
	}
}

int main() {
	scanf("%d%d%d", &n, &m, &Q);
	for (int i = 1, u, v; i <= m; i++) {
		scanf("%d%d", &u, &v);
		add(u, v); g2[v].pb(u);
	}
	memset(st, 1, sizeof st);
	for (s = 2; s <= n; s++) dfs(1);
	build();
	dfs2(1);
	for (s = 2; s <= n; s++) {
		ban = fa[s];
		dfs3(s);
	}
	while (Q--) {
		int x, y; scanf("%d%d", &x, &y);
		int p = x;
		while (p) {
			vis[p] = 1;
			p = fa[p];
		}
		for (int i = 2; i <= n; i++) {
			if (vis[fa[i]] || y == fa[i]) continue;
			if (st[i][y]) {
				c[dfn[i]]++, c[dfn[i] + sz[i]]--;
			}
		}
		int ans = 0;
		for (int i = 1; i <= n; i++) {
			c[i] += c[i - 1];
			if (c[i]) ans++;
		}
		for (int i = 1; i <= n; i++) c[i] = 0, vis[i] = 0;
		printf("%d\n", ans);
	}
	return 0;
}