#include<bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3fll
#define debug(x) cerr<<#x<<"="<<x<<endl
using namespace std;
using ll=long long;
using ld=long double;
using pli=pair<ll,int>;
using pi=pair<int,int>;
template<typename A>
using vc=vector<A>;
inline int read()
{
	int s=0,w=1;char ch;
	while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
inline ll lread()
{
	ll s=0,w=1;char ch;
	while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
bool e[1001][1001];
ll dp[1001][1001];
ll ans[1005];
ll fp[1001],tp[1001];
bool vis[1001];
int rk[1001];
vc<int>ssc[1001];
ll x[1001];
ll y[1001];
int n,c;
void dfs1(int num)
{
	vis[num]=1;
	for(int i=1;i<=n;i++) if(e[num][i]&&!vis[i]) dfs1(i);
	rk[++c]=num;
}
void dfs2(int num)
{
	vis[num]=1,ssc[c].push_back(num);
	for(int i=1;i<=n;i++) if(e[i][num]&&!vis[i]) dfs2(i);
}
inline bool check(int u,int v)
{
	for(int x:ssc[u]) for(int y:ssc[v]) if(e[x][y]) return true;
	return false;
}
int main()
{
	n=read();
	for(int i=1;i<=n;i++)
	{
		x[i]=read(),y[i]=read();int p=read();
		for(int j=1;j<=p;j++) e[i][read()]=1;
	}
	for(int i=1;i<=n;i++) if(!vis[i]) dfs1(i);
	memset(vis,0,sizeof(vis));c=0;
	for(int i=n;i;i--) if(!vis[rk[i]]) c++,dfs2(rk[i]);

	memset(ans,0x3f,sizeof(ans)),memset(dp,0x3f,sizeof(dp)),ans[0]=0;

	for(int i=1;i<=c;i++)
	{
		//计算第i个强连通分量的贡献
		sort(ssc[i].begin(),ssc[i].end(),[](int a,int b){ return x[a]<x[b];});
		memset(fp,0x3f,sizeof(fp)),memset(tp,0x3f,sizeof(tp)),fp[0]=tp[0]=0;
		memset(vis,0,sizeof(vis));
		for(int j=1;j<c;j++) if(!vis[j]&&check(j,i))
		{
			for(int p=0;p<=n;p++) tp[p]=min(tp[p],dp[j][p]);
		}
		for(int p:ssc[i])
		{
			int c=1;ll S=y[p];fp[c]=min(fp[c],S);
			for(int q:ssc[i]) if(p!=q) c++,S+=x[q],fp[c]=min(fp[c],S);
		}
		for(int x=0;x<=n;x++) for(int y=0;y<=n-x;y++) dp[i][x+y]=min(dp[i][x+y],fp[x]+tp[y]);
		for(int x=0;x<=n;x++) ans[x]=min(ans[x],dp[i][x]);
	}
	for(int i=1;ans[i]<inf;i++) printf("%lld\n",ans[i]);
	return 0;
}