n = int(input())
res = set(range(1, 101))
for _ in range(n):
r, *lines = (int(i) for i in input().split())
res &= set(lines)
print(*res)
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define cy cout<<"YES"<<endl;
#define cn cout<<"NO"<<endl;
#define c0 cout<<0<<endl;
#define c1 cout<<1<<endl;
#define f(i,a,n) for(int i=a;i<n;i++)
#define pb push_back
#define svec(v) sort(v.begin(),v.end())
#define svrev(v) sort(v.begin(),v.end(),greater<int>())
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t=1;
// cin>>t;
while(t--){
int n;
cin>>n;
int temp=n;
map<int,int> mp;
while(n--){
int r;
cin>>r;
int a[r]={};
f(i,0,r){
cin>>a[i];
mp[a[i]]++;
}
}
for(auto it:mp){
if(it.second==temp){
cout<<it.first<<" ";
}
}
cout<<endl;
}
return 0;
}
49A - Sleuth | 1541A - Pretty Permutations |
1632C - Strange Test | 673A - Bear and Game |
276A - Lunch Rush | 1205A - Almost Equal |
1020B - Badge | 1353A - Most Unstable Array |
770A - New Password | 1646B - Quality vs Quantity |
80A - Panoramix's Prediction | 1354B - Ternary String |
122B - Lucky Substring | 266B - Queue at the School |
1490A - Dense Array | 1650B - DIV + MOD |
1549B - Gregor and the Pawn Game | 553A - Kyoya and Colored Balls |
1364A - XXXXX | 1499B - Binary Removals |
1569C - Jury Meeting | 108A - Palindromic Times |
46A - Ball Game | 114A - Cifera |
776A - A Serial Killer | 25B - Phone numbers |
1633C - Kill the Monster | 1611A - Make Even |
1030B - Vasya and Cornfield | 1631A - Min Max Swap |