#ifdef __AVX2__ #pragma GCC target "avx2" #endif #pragma GCC optimize "O3" #pragma GCC optimize "unroll-loops" #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; using namespace std; #define int long long #define elif else if #define all(l) begin(l),end(l) #define rall(l) rbegin(l),rend(l) #define append push_back #define print(l) for(auto i:l) cout<<i<<' '; cout<<endl; #define pprint(a,b) cout<<a<<' '<<b<<endl; #define inp(l) for(auto &i:l) cin>>i; #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> #define pai make_pair #define endl "\n" #define pii pair<int,int> #define fi first #define se second #define vec vector // const int mod=998244353; const int mod1=998244353; const int mod=1e9+7; const int N=2e5+5; vec<int>G[N]; int n; int bfs(int r){ vec<int>p(n+1,0),ch(n+1,0); p[r]=-1; queue<int>q; q.push(r); while(q.size()){ int u=q.front(); q.pop(); for(auto v:G[u]){ if(p[v]==0){ ch[u]++; p[v]=u; q.push(v); } } } int co=0; for(int i=1;i<=n;i++){ if(ch[i]==0){ q.push(i); } if(p[i]>0) co++; } if(co<n-1){ return 1e18; } vec<int>val(n+1,1); while(q.size()){ int u=q.front(); q.pop(); for(auto v:G[u]){ if(p[v]==u) val[u]+=val[v]; } if(u!=r){ ch[p[u]]--; if(ch[p[u]]==0){ q.push(p[u]); } } } int ans=0; for(int i=1;i<=n;i++) ans+=val[i]; // print(p) return ans; } int iter=1,itera=1; void solve(){ cin>>n; for(int i=1;i<=n;i++){ int s; cin>>s; vec<int>a(s); inp(a); for(auto j:a) G[j].append(i); } int ans=1e18; int x=n,y=1; cin>>y>>x; for(int i=y;i<=x;i++){ ans=min(ans,bfs(i)); } cout<<ans<<endl; } signed main(){ // freopen("","r",stdin); // freopen("","w",stdout); ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout<<fixed<<setprecision(20); // cin>>itera; for(iter=1;iter<=itera;iter++) solve(); }