#include <bits/stdc++.h>
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e9+7;
const int inf = 1e18;
int bp(int x, int y, int p){
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int MI(int n, int p){
return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
return x * 1ull * y % p;
}
int di(int x,int y, int p){
return mul(x, MI(y, p), p);
}
int n , m , k , q;
void solve(int testcase_number){
cin>>n>>m;
bitset<61> f[(1ll<<m)];
vector<int> ans[(1ll<<m)];
vector<bitset<61>>d;
for(int i = 0;i<m;i++){
int sz;
cin>>sz;
input(int,l,sz);
bitset<61>bs;
for(int i:l){
bs[i] = 1;
}
d.pb(bs);
}
// cout<<d.size()<<endl;
// cout<<(8&-8)<<endl;
for(int i = 1;i<(1ll<<m);i++){
int fst = (i&-i);
int idx = log2(fst);
// if(idx>5)
// cout<<f[i-fst]<<endl;
// cout<<d[idx]<<endl;
f[i] = (f[i- fst ]^d[idx]);
ans[i] = ans[i-fst];
ans[i].pb(idx+1);
}
// print(ans[2]);
bitset<61>ck;
vector<int>an;
for(int i = n;i>=1;i--){
an.pb(n);
}
for(int i = 1;i<=n;i++)ck[i] = 1;
for(int i = 1;i<(1ll<<m);i++){
if((f[i]&ck) == ck){
// cout<<ans[i].size()<<endl;
sort(all(ans[i]));
// print(ans[i]);
if(ans[i] < an){
an = ans[i];
}
// break;
}
}
cout<<an.size()<<endl;
print(an);
}
signed main(){
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);
cout << fixed<<setprecision(9);
int t = 1;
// cin>>t;
for(int i = 1;i<=t;i++){
solve(i);
}
}
