#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}
 
struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
    os<<p.first<<" "<<p.second;
    return os;
}
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}

template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
    is>>p.first>>p.second;
    return is;
}

template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

int n,m;

// p[i][j],人iがjを解ける
int p[10010][1010];
int s[10010],mx[10010],mi[10010];

// 
void solve(){
    rep(i,n)rep(j,m)p[i][j]=0;
    rep(j,m){
        cin>>s[j];
        int k;cin>>k;
        rep(_,k){
            int i;cin>>i;i--;
            p[i][j]=1;
        }
    }

    // iがめっちゃ解く
    rep(i,n){
        int res=0;
        rep(j,m){
            if(p[i][j]){
                res+=s[j];
            }
        }
        mx[i]=res;
    }

    // i解かなくていいなら解かない
    rep(i,n)mi[i]=0;
    rep(j,m){
        int cnt=0;
        rep(i,n){
            cnt+=p[i][j];
        }
        if(cnt==1){
            rep(i,n){
                if(p[i][j]){
                    mi[i]+=s[j];
                }
            }
        }
    }

    int ans=0;
    rep(x,n){
        rep(y,n)if(x!=y){
            chmax(ans,mx[x]-mi[y]);
        }
    }
    // cout<<"mx ";rep(i,n)cout<<mx[i]<<" ";
    // cout<<endl;
    // cout<<"mi ";rep(i,n)cout<<mi[i]<<" ";
    // cout<<endl;
    cout<<ans+1<<endl;
}

signed main(){
    while(cin>>n>>m,n) solve();
    return 0;
}

