#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
int dx[4]={1,0,-1,0} , dy[4]={0,1,0,-1} ;
struct ppUF{
    vector<int> ra,par,ti;
    ppUF(int n){
        ra.resize(n,0);
        ti.resize(n,inf+1);
        par.resize(n,-1);
    }
    int find(int t,int x){
        if(ti[x]>t)return x;
        return find(t,par[x]);
    }

    bool unite(int t,int x,int y){
        x=find(t,x);y=find(t,y);
        if(x==y)return false;
        if(ra[x]>ra[y]){
            par[y]=x;
            ti[y]=t;
        }
        else{
            par[x]=y;
            ti[x]=t;
            if(ra[x]==ra[y])ra[y]++;
        }
        return true;
    }

    bool same(int t,int x,int y){
        return find(t,x)==find(t,y);
    }
    int time(int x,int y){
        if(!same(inf,x,y))return -1;
        int ok=inf,ng=-1,mid=0;
        while(ok-ng>1){
            mid=(ok+ng)/2;
            if(same(mid,x,y))ok=mid;
            else ng=mid;
        }
        return ok;
    }
};
int main(){
    int n,m,q;
    cin>>n>>m>>q;
    map<pint,int> mp;
    vector<int> ord;
    rep(i,m)ord.push_back(i);
    pint v[m];
    rep(i,m)cin>>v[i].first>>v[i].second;
    rep(i,q){
        int x,y;
        cin>>x>>y;
        mp[{x,y}]=q-i;
    }
    sort(ord.begin(),ord.end(),[&](int a,int b){return mp[v[a]]<mp[v[b]];});
    ppUF uf(n+1);
    for(auto idx:ord){
        uf.unite(mp[v[idx]], v[idx].first, v[idx].second);
    }
    rep(i,n-1){
        int ret=uf.time(1, i+2);
        if(ret==-1)cout<<0<<endl;
        else if(ret==0)cout<<-1<<endl;
        else cout<<q+1-ret<<endl;
    }

   return 0;
}