#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2825&lang=jp>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

struct solver{
    ll id;
    ll min_s;
    ll max_s;
    solver(){}
    solver(ll id,ll min_s, ll max_s):id(id),min_s(min_s),max_s(max_s){}
};
template<class Type>
Type solve(Type res = Type()){
    ll N,M;
    while(cin >> N >> M,N){
        vector<solver> solvers(N);
        for(int i = 0; i < N;i++){
            solvers[i] = solver(i,0,0);
        }
        
        for(int i = 0; i < M;i++){
            ll S; cin >> S;
            ll k; cin >> k;
            for(int j = 0; j < k;j++){
                ll c; cin >> c;
                c--;
                if(k == 1){
                    solvers[c].min_s += S;
                }
                solvers[c].max_s += S;
            }
        }
        
        sort(solvers.begin(),solvers.end(),[](const solver& l,const solver& r){
            return l.min_s < r.min_s;
        });
        
        solver MIN[2];
        for(int i = 0; i<  2;i++){
            MIN[i] = solvers[i];
        }
        sort(solvers.begin(),solvers.end(),[](const solver& l,const solver& r){
            return l.max_s > r.max_s;
        });
        
        solver MAX[2];
        for(int i = 0; i<  2;i++){
            MAX[i] = solvers[i];
        }
        
        ll ans = 0;
        for(int i = 0; i < 2;i++){
            for(int j = 0; j < 2;j++){
                if(MIN[i].id == MAX[j].id) continue;
                ans = max(ans,MAX[j].max_s - MIN[i].min_s);
            }
        }
        cout << ans+1 << endl;
    }
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    solve(0);
    // cout << fixed << setprecision(15) << solve<ll>() << endl;
    return 0;
}



Measured memory_bytes: 3412