import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
import java.util.stream.Stream;

public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        solve(in, out);
        out.close();
    }

    static String reverse(String s) {
        return (new StringBuilder(s)).reverse().toString();
    }

    static void sieveOfEratosthenes(int n, int factors[]) 
    { 
        factors[1]=1;
        for(int p = 2; p*p <=n; p++) 
        { 
            if(factors[p] == 0) 
            { 
                factors[p]=p;
                for(int i = p*p; i <= n; i += p) 
                    factors[i] = p; 
            } 
        } 
    }

    static void sort(int ar[]) {
        int n = ar.length;
        ArrayList<Integer> a = new ArrayList<>();
        for (int i = 0; i < n; i++)
            a.add(ar[i]);
        Collections.sort(a);
        for (int i = 0; i < n; i++)
            ar[i] = a.get(i);
    }

    static void sort1(long ar[]) {
        int n = ar.length;
        ArrayList<Long> a = new ArrayList<>();
        for (int i = 0; i < n; i++)
            a.add(ar[i]);
        Collections.sort(a);
        for (int i = 0; i < n; i++)
            ar[i] = a.get(i);
    }

    static long ncr(long n, long r, long mod) {
        if (r == 0)
            return 1;
        long val = ncr(n - 1, r - 1, mod);
        val = (n * val) % mod;
        val = (val * modInverse(r, mod)) % mod;
        return val;
    }

    public static void solve(InputReader sc, PrintWriter pw) {
        int i, j = 0;
        int t = 1;  
        // int t = sc.nextInt();
        u: while (t-- > 0) {
            long mod = 1000000007;
            int n = sc.nextInt();    
            int m = sc.nextInt();
            // HashSet<String> set = new HashSet<>();
            ArrayList<Integer> ar[] = new ArrayList[m];
            for(i=0;i<m;i++){
                ar[i] = new ArrayList<>();
            }
            ArrayList<Integer> ans = new ArrayList<>();
            // HashSet<Integer> sing = new HashSet<>();
            int sing[] = new int[m];
            for(i=0;i<n;i++){
                int k = sc.nextInt();
                if(k==1){
                    int a = sc.nextInt()-1;
                    if(sing[a]==1)
                        continue;
                        sing[a]=1;
                    ans.add(i+1);
                    for(int h:ar[a]){
                        // sing.add(h);
                        dfs(h,ar,sing);
                    }
                }
                else{
                    int a = sc.nextInt()-1;
                    int b = sc.nextInt()-1;
                    if(sing[a]==1&&sing[b]==1)
                        continue;
                    ans.add(i+1);
                    if(sing[a]==1){
                        sing[b]=1;
                        for(int y:ar[b]){
                            // sing.add(y);
                            dfs(y,ar,sing);
                        }
                    }
                    else if(sing[b]==1){
                        sing[a]=1;
                        for(int y:ar[a]){
                            // sing.add(y);
                            dfs(y,ar,sing);
                        }
                    }
                    else{
                        ar[a].add(b);
                        ar[b].add(a);
                    }
                }
            }
            pw.println(fast_pow(2,ans.size(),mod)+" "+ans.size());
            for(int y=0;y<ans.size();y++){
                pw.print(ans.get(y)+" ");
            }
            pw.println();
        }
    }

    static void dfs(int h, ArrayList<Integer> ar[], int sing[]){
        if(sing[h]==1)
            return;
        sing[h]=1;
        for(int y:ar[h]){
            dfs(y,ar,sing);
        }
        // ar[h] = new ArrayList<>();
    }

    static class Pair1 {
        long a;
        long b;
        
        Pair1(long a, long b) {
            this.a = a;
            this.b = b;
        }
    }

    static class Pair implements Comparable<Pair> {
        int a;
        int b;
        
        Pair(int a, int b) {
            this.a = a;
            this.b = b;
        }
 
        public int compareTo(Pair p) {
            if(a!=p.a)
                return p.a-a;
            return b-p.b;
        }
    }

    static boolean isPrime(long n) {
        if (n <= 1)
            return false;
        if (n <= 3)
            return true;
        if (n % 2 == 0 || n % 3 == 0)
            return false;
        for (int i = 5; i * i <= n; i = i + 6)
            if (n % i == 0 || n % (i + 2) == 0)
                return false;
        return true;
    }

    static long gcd(long a, long b) {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

    static long fast_pow(long base, long n, long M) {
        if (n == 0)
            return 1;
        if (n == 1)
            return base % M;
        long halfn = fast_pow(base, n / 2, M);
        if (n % 2 == 0)
            return (halfn * halfn) % M;
        else
            return (((halfn * halfn) % M) * base) % M;
    }

    static long modInverse(long n, long M) {
        return fast_pow(n, M - 2, M);
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }
    }
}