#pragma GCC optimized("Ofast")
#include <bits/stdc++.h>
using std::bitset;
using std::cout;
using std::deque;
using std::endl;
using std::greater;
using std::lower_bound;
using std::make_pair;
using std::map;
using std::max;
using std::min;
using std::multimap;
using std::multiset;
using std::nth_element;
using std::pair;
using std::priority_queue;
using std::queue;
using std::reverse; 
using std::set;
using std::sort;
using std::sqrt;
using std::stable_sort;
using std::string;
using std::swap;
using std::unique;
using std::upper_bound;
using std::vector;
typedef int li;
typedef long double lf; 

inline li read(){
	long long ans = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9'){
		f = (ch == '-') ? -1 : 1;
		ch = getchar();
	}
	while(ch <= '9' && ch >= '0'){
		ans = ans * 10 + (ch ^ 48);
		ch = getchar();
	}
	return ans * f;
} 

li n, m, Q, vis[3010], fa[3010], h[3010];
vector<li> g[3010];
set<li> b[3010];

li head[3010], lenedge, Head[3010];
struct node{
    li to, next;
} a[6010], B[6010];
void addedge(li u, li v){
    a[++lenedge] = {v, head[u]};
    head[u] = lenedge;
}

namespace bf{
    li size[3010], vis2[3010];
    vector<li> c[3010];
    li mp[3010][3010];

    void bfs(li u){
        queue<li> q;
        q.push(vis[u] = 1);
        while(q.size()){
            li u = q.front();
            q.pop();
            for(li i = head[u]; i; i = a[i].next){
                if(!vis[a[i].to]){
                    vis[a[i].to] = 1;
                    q.push(a[i].to);
                }
            }
        }
    }

    void pre(){
        for(li i = 2; i <= n; i++){
            for(li j = 2; j <= n; j++) vis[j] = 0;
            vis[i] = 1;
            bfs(1);
            for(li j = 2; j <= n; j++){
                if(!vis[j]) b[j].insert(i), vis2[i] = 1, c[i].push_back(j), mp[i][j] = 1;
            }
        }
    }
    li FL;

    void dfs(li i){
        // cout << "i = " << i << endl;
        // if(g[i].size() == 0) return;
        if(FL && h[i] == 2) return;
        if(h[i] == 1) return;
        for(li j = 2; j <= n; j++) vis[j] = 0;
        vis[i] = 1;
        bfs(1);
        li fl = 1;
        for(li j = 2; j <= n; j++){
            if(mp[i][j] != (!vis[j])){
                size[j] = 1;
                fl = 0;
                FL = 1;
            }
        }
        // cout << i << " " << fl << endl;
        if(!fl) return;
        for(li v : g[i]){
            dfs(v);
        }
    }

    void work(){
        // for(li i = 1; i <= n; i++, printf("\n")){
        //     for(li v : b[i]) printf("%lld ", v);
        // }
        for(li i = 1; i <= n; i++) Head[i] = head[i];
        for(li i = 1; i <= lenedge; i++) B[i] = a[i];
        while(Q--){
            FL = 0;
            li u = read(), v = read();
            // a[u].push_back(v);
            for(li i = 1; i <= n; i++) head[i] = Head[i];
            for(li i = 1; i <= lenedge; i++) a[i] = B[i];
            addedge(u, v);
            li FL = 0;
            for(li i = 2; i <= n; i++) size[i] = 0;
            // for(li i = 1; i <= n; i++){
            //     if(h[i] == 2){
            //         for(li j = 2; j <= n; j++) vis[j] = 0;
            //         vis[i] = 1;
            //         bfs(1);
            //         li fl = 1;
            //         for(li j = 2; j <= n; j++){
            //             if(mp[i][j] != (!vis[j])){
            //                 size[j] = 1;
            //                 fl = 0;
            //                 FL = 1;
            //             }
            //         }
            //     }
            // }
            // if(!FL){
            //     a[u].pop_back();
            //     printf("0\n");
            //     continue;
            // }
            // if(b[v].size() == 0){
            //     printf("0\n");
            //     continue;
            // } 
            dfs(1);
            li ans = 0;
            for(li i = 2; i <= n; i++){
                // cout << size[i] << " " << b[i].size() << endl;
                if(size[i]) ans++;
            }
            printf("%d\n", ans);
            lenedge--;
            // a[u].pop_back();
        }
        exit(0);
    }
}

void dfs2(li u){
    for(li v : g[u]){
        dfs2(v);
        h[u] = max(h[u], h[v]);
    }
    h[u]++;
}

int main(){
    // freopen("wonderful.ans", "r", stdin);
    // freopen("www.ww", "w", stdout);
    // freopen("dominator.in", "r", stdin);
    // freopen("dominator.out", "w", stdout);
	n = read(), m = read(), Q = read();
    for(li i = 1; i <= m; i++){
        li u = read(), v = read();
        // a[u].push_back(v);
        addedge(u, v);
    }
    bf::pre();
    for(li i = 2; i <= n; i++) b[i].insert(1);
    // for(li i = 1; i <= n; i++, cout << endl) for(li v : b[i]) cout << v << " ";
    // for(li i = 2; i <= n; i++) b[i].erase(i);
    memset(vis, 0, sizeof vis);
    for(li C = 1; C <= n; C++){
        li minn = 0, size = 1e9;
        for(li i = 1; i <= n; i++){
            if(b[i].size() < size && !vis[i]){
                minn = i, size = b[i].size();
            }
        }
        assert(size <= 1);
        vis[minn] = 1;
        if(size == 1){
            li u = *b[minn].begin();
            g[fa[minn] = u].push_back(minn);
            for(li j = 1; j <= n; j++){
                if(!vis[j]){
                    if(b[j].find(u) != b[j].end() && b[j].find(minn) != b[j].end()) b[j].erase(u);
                }
            }
        }
    }
    // cout << endl;
    // for(li i = 1; i <= n; i++) for(li v : g[i]){
    //     if(g[v].size()) cout << i << " " << v << " " << bf::mp[i][v] << " " << bf::mp[v][i] << endl;
    // }
    dfs2(1);
    // for(li i = 1; i <= n; i++) if(h[i] == 2) cout << "i = " << i << endl;
    bf::work();
    return 0;
}