Help me in solving DISHLIFE problem

help
,
1

My issue

help

My code

#include <bits/stdc++.h>
#define ll long long int
using namespace std;

int main() {
	// your code goes here
	
	int t;
	cin>>t;
	

	while(t--){
	    ll n,x;
	    cin>>n>>x;
	    unordered_map<ll,ll>ump;
	    
	  for(ll i=1;i<=n;i++){
	       ll a;
	       cin>>a;
	       ump[a]++;
	       while(a--){
	            ll b;
	           cin>>b;
	           ump[b]++;
	       }
	       ll k=ump.size();
	       if(i<n){
	           if(k==x){
	           cout<<"some\n";
	           break;
	          }
	        
	       }
	       else if(i==n) {
	           if(k==x){
	               cout<<"all\n";
	           }
	           else {cout<<"sad\n";
	           }
                     	  }
	       }
	       
	}
	return 0;
}

Problem Link: DISHLIFE Problem - CodeChef