#include<bits/stdc++.h>
using namespace std;
#define int long long
#define md(a) a=(a%mod+mod)%mod
#define file(a) freopen(#a".in","r",stdin);freopen(#a".out","w",stdout)

bool ST;

const int N=3005,M=500005;int sum[N][N],ans,Shift;bool swa[M];
int n,m,Q,prt[N],L[N],R[N],sign,bk[N];bool tag[M],vst[N];struct EDGE{int x,y;}E[M];vector<pair<int,int> >son[N],nxt[N];
inline void ade(int x,int y,int id){nxt[x].push_back({y,id});}inline void zcy(int x,int y,int id){ade(x,y,id),ade(y,x,id);}
inline int S(int xa,int xb,int ya,int yb){return sum[xb][yb]-sum[xa-1][yb]-sum[xb][ya-1]+sum[xa-1][ya-1];}
void idfs(int x,int fa)
{
	prt[x]=fa,vst[x]=1,L[x]=++sign,bk[sign]=x;
	for(auto pa:nxt[x])
	{
		int y=pa.first,id=pa.second;if(vst[y])continue;
		// cout<<x<<"->"<<y<<'\n';
		son[x].push_back({y,id}),tag[id]=1;if(E[id].x==y)swap(E[id].x,E[id].y),swa[id]^=1;idfs(y,x);
	}
	R[x]=sign;
}
int t,id[120],uv[120],vu[120],X[120],Y[120],sz[120];bool f[120][120];
struct num{int l,r;}a[120];int cnt,dis[120][120];vector<int>del[120];
inline bool cmp(num a,num b){return a.l<b.l||(a.l==b.l&&a.r>b.r);}
inline void Query()
{
	ans=cnt=0;cin>>t;for(int i=1;i<=t;i++)cin>>id[i]>>uv[i]>>vu[i],id[i]=(id[i]+Shift)%m+1;
	for(int i=1;i<=t;i++)if(swa[id[i]])swap(uv[i],vu[i]);
	// for(int i=1;i<=t;i++)cout<<"close:"<<id[i]<<" "<<uv[i]<<" "<<vu[i]<<'\n';
	for(int i=1;i<=t;i++)if(tag[id[i]])a[++cnt]={L[E[id[i]].y],R[E[id[i]].y]};a[++cnt]={1,n};sort(a+1,a+cnt+1,cmp);
	// for(int i=1;i<=cnt;i++)cout<<a[i].l<<' '<<a[i].r<<'\n';
	for(int x=1;x<=cnt;x++)for(int y=1;y<=cnt;y++)dis[x][y]=0;
	for(int i=1;i<=t;i++)
	{
		int p=L[E[id[i]].x],q=L[E[id[i]].y];X[i]=Y[i]=cnt;
		while(p<a[X[i]].l||p>a[X[i]].r)X[i]--;while(q<a[Y[i]].l||q>a[Y[i]].r)Y[i]--;
		if(X[i]==Y[i])continue;
		// cout<<X[i]<<" "<<Y[i]<<" "<<tag[id[i]]<<" "<<id[i]<<'\n';
		if(tag[id[i]]){if(!uv[i])dis[X[i]][Y[i]]++;if(!vu[i])dis[Y[i]][X[i]]++;}
		else {if(uv[i])dis[X[i]][Y[i]]--;if(vu[i])dis[Y[i]][X[i]]--;}
	}
	// for(int i=1;i<=cnt;i++,cout<<'\n')for(int j=1;j<=cnt;j++)cout<<dis[i][j]<<' ';
	// cout<<'\n';
	for(int x=1;x<=cnt;x++)
	{
		del[x].clear();int las=0;sz[x]=a[x].r-a[x].l+1;
		for(int y=x+1;y<=cnt;y++)
		{
			if(a[y].l>a[x].r)break;
			if(a[y].l>las)del[x].push_back(y),las=a[y].r,sz[x]-=a[y].r-a[y].l+1;
		}
		assert(sz[x]>=0);
		// cout<<x<<":"<<sz[x]<<'\n';
	}
	for(int x=1;x<=cnt;x++)for(int y=1;y<=cnt;y++)if(x!=y)
	{
		// cout<<"getdis:"<<x<<' '<<y<<'\n';
		dis[x][y]+=S(a[x].l,a[x].r,a[y].l,a[y].r);
		for(int u:del[x])dis[x][y]-=S(a[u].l,a[u].r,a[y].l,a[y].r);
		for(int v:del[y])dis[x][y]-=S(a[x].l,a[x].r,a[v].l,a[v].r);
		for(int u:del[x])for(int v:del[y])dis[x][y]+=S(a[u].l,a[u].r,a[v].l,a[v].r);
	}
	// for(int i=1;i<=cnt;i++,cout<<'\n')for(int j=1;j<=cnt;j++)cout<<dis[i][j]<<' ';
	// cout<<'\n';
	for(int x=1;x<=cnt;x++)for(int y=1;y<=cnt;y++)f[x][y]=(x==y||dis[x][y]>0);
	for(int k=1;k<=cnt;k++)for(int i=1;i<=cnt;i++)for(int j=1;j<=cnt;j++)f[i][j]|=(f[i][k]&f[k][j]);
	for(int i=1;i<=cnt;i++){bool fg=1;for(int j=1;j<=cnt;j++)fg&=f[j][i];if(fg)ans+=sz[i];}
}

bool ED;

signed main()
{
	int time_st=clock();
	cerr<<(&ST-&ED)/1024.0/1024<<endl;ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	// file(a);
	cin>>n>>m>>Q;for(int i=1;i<=m;i++)cin>>E[i].x>>E[i].y,zcy(E[i].x,E[i].y,i);
	idfs(1,0);for(int i=1;i<=m;i++)if(!tag[i]){int x=L[E[i].x],y=L[E[i].y];sum[x][y]++,sum[y][x]++;}
	// for(int i=1;i<=n;i++,cout<<'\n')for(int j=1;j<=n;j++)cout<<sum[i][j]<<' ';cout<<'\n';
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)sum[i][j]+=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
	while(Q--){Query();cout<<ans<<'\n';Shift+=ans;}
	cerr<<(clock()-time_st)/1e6<<endl;return 0;
}