/**
*   author : GDA
*   created : 08/12/2020
*
**/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required
#define pb push_back
#define pf push_front
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define distinct(x) sort(all(x)); x.resize(unique(all(x))-x.begin());
#define sz(x)  (long long)(x).size()
#define sqr(x) (x)*(x)
#define sof sizeof
#define resz resize
#define ins insert
#define Vec vector
#define lowerB lower_bound
#define upperB upper_bound
#define mkp make_pair
#define mkt make_tuple
#define act(a,v) (get<(long long)a>(v))
#define mod 1000000007
#define mod1 998244353
#define N 500003  //N idhar hai
#define M 100003  //M idhar hai
#define inf 1e18
#define minf -1e18
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define ms(dp,a) memset(dp,(ll)a,sof(dp))
#define Foreach(i, c) for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define fr(i,b) for(int (i)=(0);(i) < (b); ++(i))
#define For(i,a,b) for(int (i)=(a);(i) < (b); ++(i))
#define rof(i,a,b) for(int (i)=(a);(i) >= (b); --(i))
#define rep(i, c) for(auto &(i) : (c))
#define FastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define PRECISION(n) std::cout.unsetf ( std::ios::floatfield );std::cout.precision((ll)n)
#define getsm(v) accumulate(all(v),(ll)0)
#define getmx(v) max_element(all(v))
#define getmn(v) min_element(all(v))
#define ws1(a) cout<<(a)<<" "
#define wr1(a) cout<<(a)<<endl
#define wr2(a,b) cout<<(a)<<" "<<(b)<<endl
#define wr3(a,b,c) cout<<(a)<<" "<<(b)<<" "<<(c)<<endl
#define wr4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<endl
#define ww1(a) cout<<(a)<<"\n"
#define ww2(a,b) cout<<(a)<<" "<<(b)<<"\n"
#define ww3(a,b,c) cout<<(a)<<" "<<(b)<<" "<<(c)<<"\n"
#define ww4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<"\n"
#define FileIO freopen("input.txt","r",stdin);freopen("output.txt","w",stdout)
#define fill(dp,a,b) for(int i=0;i<a;i++)for(int j=0;j<b;j++)dp[i][j]=-1;
#define PI 3.14159265358979323846264338327950288419716939937510
#define fi first
#define se second
#define here cout<<"RSSB"<<endl
#define dbg cout<<"Krishna"<<endl
#define showzero cout<<std::showpoint
#define bitcount( x ) (ll)__builtin_popcountll( x )
#define ls(i) (1ll<<(i))
using namespace __gnu_pbds; //required
using namespace  std ;
typedef double db;
typedef long long ll ; //long long
typedef vector<int>vi ;
// typedef vector<l>vl ;
typedef vector<ll>vll ;
typedef vector<vector<ll> >vvl ;
typedef pair<int,int> pii ;
typedef pair<ll,ll> pll ;
typedef vector<pll>vpll;
typedef vector<string>vstr;
typedef vector<bool>vbool ;
template <typename T> using ordered_set =  tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T = ll>
void readArray(Vec<T> &v, ll n){T a ;for(ll i=0 ; i<n ; i=i+1){cin>>a ;v.pb(a);}}
template <class T = ll>
void printArray(Vec<T> &v , ll a = 0){for(ll i=a ; i<v.size() ; i=i+1){/*v[i] = max((ll)0,v[i]);*/cout<<v[i]<<" " ;}cout<<"\n" ;}
ll stringToInteger(string str1 , ll x = 0){ll a,b;b = sz(str1);a = 0;ll c = 1;reverse(all(str1));for(ll i=0 ; i<b ; i++){a+=(str1[i]-'0')*c;c*=10;if(x){c%=mod;a%=mod;}}return(a);}
string integerToString(ll x){string str1 = "";while(x){ll c = x%10;str1+=(c+'0');x/=10;}reverse(all(str1));return(str1);}
double logy(ll n , ll b){if(b==0){return(-1);}if(n==1){return(0);}return((db)log10(n)/(db)log10(b));}
long long power(long long k , long long n , long long m=mod){long long res = 1;while(n){if(n%2!=0){res = (res*k)%m ;}k = (k*k)%m ;n = n/2 ;}return(res) ;}
double powerD(double k , long long n ){double res = 1;while(n){if(n%2!=0){res = (res*k) ;}k = (k*k) ;n = n/2 ;}return(res) ;}
ll gcdExtend(ll a , ll b , ll &x , ll &y){if(a==0){x = 0;y = 1;return(b);}ll x1,y1;ll g = gcdExtend(b%a,a,x1,y1);x = y1 - (b/a)*x1;y = x1;return(g);}
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
#define lcm(a,b) ((a/gcd(a,b))*b)
void mul(ll &x , ll a){if(a<0){a+=mod;}else{a%=mod;}x = (x%mod*a%mod)%mod;}
void addition(ll &x , ll a){x = (x%mod + a%mod)%mod;}
double distance(pair<double,double> a , pair<double,double> b){return((double)(sqrt( sqr(a.fi-b.fi) + sqr(a.se-b.se))));}
// void maxi(ll &x , ll a = minf , ll b = minf){x = max3(x,a,b);}
// void mini(ll &x , ll a = inf , ll b = inf){x = min3(x,a,b);}
const ll ddx[8] = {-1,1,0,0,-1,1,-1,1};
const ll ddy[8] = {0,0,-1,1,-1,-1,1,1};
ll n,m,k,h,a1,a2,a3,t;
//db prob;
string str,str1,str2;
bool ok = true;
Vec<vpll> v;
vvl g;
vll vis;
vll ans;
vll par;
vll cnt;
vll tmp;
void dfs(ll i)
{
    vis[i] = 3;
    tmp.pb(i);
    for(auto &[j,p] : v[i])
    {
        if(vis[j]==1)
        {
            // ans.pb(p+1);
            cnt[j] = p;
            dfs(j);
        }
        else
        {
            cnt[j] = min(cnt[j],p);
        }
    }
}
ll findPar(ll a)
{
    if(a==par[a])
    {
        return(a);
    }
    par[a] = findPar(par[a]);
    return(par[a]);
}
ll join(ll a , ll b)
{
    a = findPar(a);
    b = findPar(b);
    if(a==b)
    {
        return(0);
    }
    par[b] = a;
    return(1);
}
void solveIt()
{
    ll a,b,c,d,i,j,x,y,z,tt;
    ll p,q,r,w;
    // string str2;
    char ch;
    // ms(dp,-1);
    //* SpeakOutLoudWhatYouAreThinkingWhileSolvingQuestion
    //* WhyDoWeFallBruce?
    //* Bemat
    //* I Don't Ever Give Up-ElonMusk
    //* Zero-ImagineDragons
    cin>>n>>m;
    v.resz(m+1);
    g.resz(n);
    vis.resz(m+1);
    par.resz(m+1);
    cnt.resz(m+1);
    // vll ans;
    for(i=0 ; i<m+1 ; i++)
    {
        vis[i] = 0;
        par[i] = i;
        cnt[i] = n+1;
    }
    for(i=0 ; i<n ; i++)
    {
        cin>>b;
        if(b==1)
        {
            cin>>x;
            g[i].pb(x);
            // single.pb(i);
            cnt[x] = i;
            // ans.pb(i+1);
            vis[x] = 2;
        }
        else
        {
            cin>>a>>b;
            vis[a] = max(vis[a],1ll);
            vis[b] = max(vis[b],1ll);
            g[i].pb(a);
            g[i].pb(b);
            v[a].pb({b,i});
            v[b].pb({a,i});
        }
    }
    for(i=0 ; i<n ; i++)
    {
        if(sz(g[i])==1)
        {
            x = g[i][0];
            if(vis[x]==2)
            {
                tmp.clear();
                dfs(x);
                for(auto j : tmp)
                {
                    ans.pb(cnt[j]+1);
                }
            }
        }
    }
    for(i=0 ; i<n ; i++)
    {
        if(sz(g[i])>1)
        {
            a = g[i][0];
            b = g[i][1];
            if(vis[a]==1)
            {
                x = join(a,b);
                if(x)
                {
                    ans.pb(i+1);
                }
            }   
        }
    }
    sort(all(ans));
    x = sz(ans);
    y = power(2,x,mod);
    ww2(y,x);
    printArray(ans);
}
int main()
{
#ifndef ONLINE_JUDGE
       freopen("Rinput.txt", "r", stdin);
       freopen("Routput.txt", "w", stdout);
#endif
    FastIO;
    PRECISION(12);
    //FileIO;
    //Inverse Modulo(for division under mod) = phi(m) - 1 ===> if m is prime then = m-2
    //dr.pb(mkp(0,1));dr.pb(mkp(1,0));dr.pb(mkp(0,-1));dr.pb(mkp(-1,0));
    //For a Graph Problem Sometimes BFS instead of DFS is much helpful
    ll t = 1;
    //cin>>t;
    while(t--)
    {
        solveIt();
    }
    // const ll ddx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
    // const ll ddy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
    //WhateverItTakes
    //FOCUS
    //BeABelieverWarrior
    //DO IT UNTIL YOU RUN OUT OF IDEAS ~ YOU KNOW WHO
    //See The Editorial Almost Never ~ YOU KNOW WHO
    /*In Case of TLE -> 1.Use Int instead of Long Long
                    2.Use FastIO
                    3.Use "\n" Instead of endl
                    4.Use Vector and Arrays instead of Sets,Maps(if possible)
    */
}