#include #define fi first #define se second #define rep(i,n) for(int i = 0; i < (n); ++i) #define rrep(i,n) for(int i = 1; i <= (n); ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define rng(a) a.begin(),a.end() #define rrng(a) a.rbegin(),a.rend() #define isin(x,l,r) ((l) <= (x) && (x) < (r)) #define pb push_back #define eb emplace_back #define sz(x) (int)(x).size() #define pcnt __builtin_popcountll #define uni(x) x.erase(unique(rng(x)),x.end()) #define snuke srand((unsigned)clock()+(unsigned)time(NULL)); #define show(x) cerr<<#x<<" = "< > #define bn(x) ((1< #define vv(T) v(v(T)) using namespace std; typedef long long int ll; typedef unsigned uint; typedef unsigned long long ull; typedef pair P; typedef tuple T; typedef vector vi; typedef vector vvi; typedef vector vl; typedef vector

vp; typedef vector vt; int getInt(){int x;scanf("%d",&x);return x;} templateistream& operator>>(istream&i,v(T)&v){rep(j,sz(v))i>>v[j];return i;} templatestring join(const v(T)&v){stringstream s;rep(i,sz(v))s<<' '<ostream& operator<<(ostream&o,const v(T)&v){if(sz(v))o<istream& operator>>(istream&i,pair&v){return i>>v.fi>>v.se;} templateostream& operator<<(ostream&o,const pair&v){return o<bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;} templatebool maxs(T& x,const T&y){if(xll suma(const v(T)&a){ll res(0);for(auto&&x:a)res+=x;return res;} const double eps = 1e-10; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; #define dame { puts("0"); return;} #define yn {puts("Yes");}else{puts("No");} const int MX = 200005; // SCC // upstream is smaller id struct scc { int n, k; vvi to, ot, d, gt; // to, rev_to, groups, group_to vi g, used, kv; // group, gomi, topo_ord scc(int n=0):n(n),to(n),ot(n){} int inc() { to.pb(vi()); ot.pb(vi()); return n++;} void add(int a, int b) { to[a].pb(b); ot[b].pb(a);} void dfs(int v) { if (used[v]) return; used[v] = 1; rep(i,sz(to[v])) dfs(to[v][i]); kv[--k] = v; } void rfs(int v) { if (g[v] != -1) return; g[v] = k; d[k].pb(v); rep(i,sz(ot[v])) rfs(ot[v][i]); } void init() { k = n; used = kv = vi(n); g = vi(n,-1); rep(i,n) dfs(i); rep(i,n) if (g[kv[i]] == -1) { d.pb(vi()); rfs(kv[i]); k++; } gt = vvi(k); rep(i,n)rep(j,sz(ot[i])) { int v = g[ot[i][j]], u = g[i]; if (v != u) gt[v].pb(u); } rep(i,k) { sort(rng(gt[i])); gt[i].erase(unique(rng(gt[i])),gt[i].end()); } } }; // struct Solver { void solve() { int n; scanf("%d",&n); int m = 2000; scc g(m); rep(i,n) { int l; scanf("%d",&l); vi a(l); cin>>a; rep(j,l) --a[j]; if (l == 1) continue; g.add(a[0],a.back()); } g.init(); if (g.k != m) dame; vi ans(m); rep(i,m) ans[i] = g.d[i][0]+1; cout<