#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,k[N],p[N];
vector<int>stk[N];
int dfs(int x){
	while(p[x]>=1){
		p[x]--;
		x=stk[x][p[x]+1];
	}
	return x;
}
int main(){
	freopen("stack.in","r",stdin);
	freopen("stack.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",k+i);stk[i].push_back(0); 
		for(int j=1,x;j<=k[i];j++){
			scanf("%d",&x);
			stk[i].push_back(x);
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++)p[j]=k[j];
		printf("%d ",dfs(i));
	}
	return 0;
}