#include<bits/stdc++.h> using namespace std; #define int long long const int mod=1000000007; inline int read(){ int x=0; bool f=1; char c=getchar(); while(c>'9'||c<'0'){if(c=='-')f=0;c=getchar();} while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+c-'0';c=getchar();} return f?x:-x; } inline int qp(int x,int y){ int ans=1; while(y){ if(y&1)ans=ans*x%mod; x=x*x%mod; y>>=1; } return ans; } int n,m,t,u,v,a[200005],ans=1; signed main(){ n=read(),m=read(),t=read(); while(m--){ u=read(),v=read(); a[v]++; } for(int i=2;i<=n;i++)ans=ans*a[i]%mod; cout<<ans<<endl; for(int i=1;i<=t;i++){ u=read(),v=read(); a[v]++; ans=(ans*qp(a[v]-1,mod-2)%mod*(a[v]%mod))%mod; cout<<ans<<endl; } return 0; }