// 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
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 3000005
#define inf 0x3f3f3f3f

int n,p,q;
bool e[2505][2505];
vi g[2505];

int col[2505],cnt;
vi vec[2505];

int check(vi o){
	if(o.size()>p)return p+q+1;
	int sum=0;
	for(int u:o)sum+=g[u].size();
	for(int u:o)for(int v:o)sum-=e[u][v];
	return sum;
}
bool orz[2505];
vi outs(vi a,vi b){
	vi c;
	for(auto x:b)orz[x]=1;
	for(auto x:a)if(!orz[x])c.pb(x);
	for(auto x:b)orz[x]=0;
	return c;
}
bool in(vi &a,vi &b){
	bool hav=1;
	for(auto x:b)orz[x]=1;
	for(auto x:a)if(!orz[x])hav=0;
	for(auto x:b)orz[x]=0;
	return hav;
}

mt19937_64 rnd(19890531);
vi ans;
map<vi,bool>mp;
bool dfs(vi o){
//	cout<<"dfs: ";for(auto x:o)cout<<x<<" ";puts("");
	if(o.size()>p)return 0;
	int qwq=check(o);
	if(qwq<=q){
		ans=o;
		return 1;
	}
	if(n>1500&&qwq>p+q)return 0;
	
	sort(o.begin(),o.end());
	if(mp.count(o))return 0;
	
	set<int>pos;
	for(auto x:o)for(auto y:g[x])pos.insert(y);
	for(auto x:o)pos.erase(x);
	if(pos.size()+o.size()>p+q)return 0;
	
//	for(auto t:o)cout<<t<<" ";puts("");
	vi vc;
	for(auto x:pos)vc.pb(x);
	shuffle(vc.begin(),vc.end(),rnd);
	int siz=vc.size();
//	cout<<"siz: ";for(int x:vc)cout<<x<<" ";puts(""); 
	For(i,1,(1<<siz)-1)
		if(__builtin_popcount(i)+o.size()<=p){
			vi oo=o;
			For(j,0,siz-1)if(i>>j&1)oo.pb(vc[j]);
			if(dfs(oo))return 1;
		}
	mp[o]=1;
	return 0;
}

signed main()
{
//	freopen("test31_true.in","r",stdin);
	n=read(),p=read(),q=read();
	For(i,0,n-1){
		g[i].resize(read());
		for(auto&x:g[i])x=read(),e[i][x]=1;
	}
	For(i,0,n-1)For(j,0,n-1)if(e[i][j]&&!e[j][i])puts("detention"),exit(0);
	For(i,0,n-1)if(g[i].size()>p+q)puts("detention"),exit(0); 
	For(i,0,n-1){
		if(col[i])continue;
	//	int m=g[i].size();
		mp.clear();
		vi o={i}; ans.clear();
		if(!dfs(o)){
			puts("detention");
			exit(0); 
		}
		vec[i]=ans;
		for(auto x:vec[i])col[x]=1;
	}
	For(i,0,n)col[i]=0;
	For(i,0,n-1)
		For(j,i+1,n-1){
			if(in(vec[i],vec[j])){vec[i].clear();continue;}
			if(in(vec[j],vec[i])){vec[j].clear();continue;}
			vi o1=outs(vec[i],vec[j]);
			if(check(o1)<=q){vec[i]=o1;continue;}
			vi o2=outs(vec[j],vec[i]);
			if(check(o2)<=q){vec[j]=o2;continue;}
			assert(0);
		}
	puts("home");
	vector<vi>res; 
	For(i,0,n-1)
		if(!col[i] && vec[i].size()){
			for(auto u:vec[i]) col[u]=1;
			res.pb(vec[i]);
		}
	cout<<res.size()<<"\n";
	for(auto t:res){
		cout<<t.size()<<" ";
		for(int x:t)cout<<x<<" ";
		puts("");
	}
	return 0;
}