// what is matter? never mind.
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 1000005
#define inf 0x3f3f3f3f
#define bint bitset<1005>

int ls[maxn],rs[maxn],sz[maxn],cnt,fa[maxn];
bint a[maxn],b[maxn],aa,bb;

int allsz,root;
void dfs(int u){
	sz[u]=1;
	if(ls[u])dfs(ls[u]),sz[u]+=sz[ls[u]];
	if(rs[u])dfs(rs[u]),sz[u]+=sz[rs[u]];
	if(max(sz[ls[u]],sz[rs[u]])*3<=allsz && sz[u]*3>=allsz)root=u;
}

int merge(int l,int r){
	if(!l||!r)return l|r;
	int u=++cnt;
	ls[u]=l,rs[u]=r,fa[l]=fa[r]=u,sz[u]=sz[l]+sz[r]+1,a[u]=a[l]|a[r],b[u]=b[l]|b[r];
	return u;
}

int get(int rt){
	if(!rt)return 0;
	if(!ls[rt]&&!rs[rt]){
		bint na=a[rt]&aa,nb=b[rt]&bb;
		if(!na.any()||!nb.any())return 0;
		int u=++cnt;
		a[u]=na,b[u]=nb,sz[u]=1;
		return u;
	}
	return merge(get(ls[rt]),get(rs[rt]));
}

int And(int rt,bint a,bint b){
	aa=a,bb=b;
	return get(rt);
}

int solve(int rt){
	if(sz[rt]<5)return rt;
	allsz=sz[rt],dfs(rt);
	int u=root;
	bint aa=a[u],bb=b[u],ra=a[rt]&(~a[u]),rb=b[rt]&(~b[u]); 
	int t1=solve(And(rt,aa,bb));
	int t2=solve(And(rt,aa,rb));
	int t3=solve(And(rt,ra,b[rt]));
	return merge(merge(t1,t2),t3);
}

int mp[maxn],idx,que[maxn];
void dfs0(int u){
	que[idx]=u;
	mp[u]=idx++;
	if(ls[u])fa[ls[u]]=u,dfs0(ls[u]);
	if(rs[u])fa[rs[u]]=u,dfs0(rs[u]);
}

signed main()
{
	int n=read();
	For(i,1,n)For(j,1,n)read();
	cnt=read();
	int rt=0;
	For(i,1,cnt){
		fa[i]=read()+1;
		if(fa[i]==i)rt=i;
		else{
			if(!ls[fa[i]])ls[fa[i]]=i;
			else rs[fa[i]]=i;
		}
		int m1=read(),m2=read();
		while(m1--)a[i].set(read());
		while(m2--)b[i].set(read());
	}
	dfs(rt);
	rt=solve(rt);
	dfs0(rt);
	assert(idx==sz[rt]);
	cout<<idx<<"\n";
	For(i,0,idx-1){
		int u=que[i];
		if(u==rt)cout<<mp[rt]<<" ";
		else cout<<mp[fa[u]]<<" ";
		cout<<a[u].count()<<" "<<b[u].count()<<" ";
		for(int x=a[u]._Find_first();x<n;x=a[u]._Find_next(x))cout<<x<<" ";
		for(int x=b[u]._Find_first();x<n;x=b[u]._Find_next(x))cout<<x<<" ";
		cout<<"\n";
	}
	return 0;
}