#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
//#define int long long
using namespace std;

int N, M, Q;

int A[200000], B[200000];
int C[200000], D[200000];
set<pair<int, int> > kowareru;

int par[200010];
int ranks[200010];

int ans[200010];

void init(int n) {
	for (int i=0; i<n; i++) {
		par[i] = i;
		ranks[i] = 0;
	}
}

int find(int x) {
	if (par[x] == x) {
		return x;
	} else {
		return par[x] = find(par[x]);
	}
}

void unite(int x, int y) {
	x = find(x);
	y = find(y);

	if (x == y) return;

	if (ranks[x] < ranks[y]) {
		par[x] = y;
	} else {
		par[y] = x;
		if (ranks[x] == ranks[y]) ranks[x]++;
	}
}

bool same(int x, int y) {
	return find(x) == find(y);
}

signed main()
{
	cin >> N >> M >> Q;
	rep(i,M) cin >> A[i] >> B[i];
	rep(i,Q) {
		cin >> C[i] >> D[i];
		kowareru.insert(make_pair(C[i], D[i]));
	}

	init(N + 1);

	rep(i,M) {
		if (kowareru.find(make_pair(A[i], B[i])) == kowareru.end()) {
			unite(A[i], B[i]);
		}
	}

	rep(i,N) {
		if (same(1, i)) ans[i] = -1;
	}

	for (int i=Q-1; i>=0; i--) {
		/*
		vector<int> not_con(2);
		if (!same(C[i], 1)) {
			not_con.push_back(C[i]);
		}
		if (!same(D[i], 1)) {
			not_con.push_back(C[i]);
		}
		*/
		/*
		unite(C[i], D[i]);
		if ((not_con[0] == C[i] || not_con[1] == C[i]) && same(C[i], 1)) {
			ans[C[i]] = Q - i;
		}
		if ((not_con[0] == D[i] || not_con[1] == D[i]) && same(D[i], 1)) {
			ans[D[i]] = Q - i;
		}
		*/
		unite(C[i], D[i]);
		if (same(C[i], 1) && ans[C[i]] != -1) {
			ans[C[i]] = Q - i;
		}
		if (same(D[i], 1) && ans[D[i]] != -1) {
			ans[D[i]] = Q - i;
		}
	}

	
	for (int i=2; i<N; i++) {
		cout << Q - ans[i] << endl;
	}
	
}