import java.io.*;
import java.util.*;

public class Main2{
	static int mod=(int)1e9+7;
	static void main() throws Exception{
		int n=sc.nextInt(),m=sc.nextInt();
		TreeSet<int[]>all=new TreeSet<int[]>((x,y)->x[0]!=y[0]?x[0]-y[0]:x[0]==1?x[1]-y[1]:x[1]==y[1]?x[2]-y[2]:x[1]-y[1]);
		int[][]in=new int[n][];
		for(int i=0;i<n;i++) {
			int k=sc.nextInt();
			if(k==1) {
				in[i]=new int[] {1,sc.nextInt()};
			}
			else {
				in[i]=new int[] {2,sc.nextInt(),sc.nextInt()};
			}
			all.add(in[i]);
		}
		for(int i=0;i<n;i++) {
			if(in[i][0]==2) {
				if(all.contains(new int[] {1,in[i][1]}) && all.contains(new int[] {1,in[i][2]})) {
					all.remove(in[i]);
				}
			}
		}
		long ans=1;
		for(int i=0;i<all.size();i++) {
			ans=(ans*2)%mod;
		}
		pw.println(ans+" "+all.size());
		for(int i=0;i<n;i++) {
			if(all.contains(in[i])) {
				pw.print((i+1)+" ");
				all.remove(in[i]);
			}
		}
		pw.println();
	}
	public static void main(String[] args) throws Exception{
		sc=new MScanner(System.in);
		pw = new PrintWriter(System.out);
		int tc=1;
//		tc=sc.nextInt();
		while(tc-->0)
			main();
		pw.flush();
	}
	static PrintWriter pw;
	static MScanner sc;
	static class MScanner {
		StringTokenizer st;
		BufferedReader br;
		public MScanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}
	 
		public MScanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}
	 
		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public int[] intArr(int n) throws IOException {
	        int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();
	        return in;
		}
		public long[] longArr(int n) throws IOException {
	        long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();
	        return in;
		}
		public int[] intSortedArr(int n) throws IOException {
	        int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();
	        shuffle(in);
	        Arrays.sort(in);
	        return in;
		}
		public long[] longSortedArr(int n) throws IOException {
	        long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();
	        shuffle(in);
	        Arrays.sort(in);
	        return in;
		}
		public Integer[] IntegerArr(int n) throws IOException {
	        Integer[]in=new Integer[n];for(int i=0;i<n;i++)in[i]=nextInt();
	        return in;
		}
		public Long[] LongArr(int n) throws IOException {
	        Long[]in=new Long[n];for(int i=0;i<n;i++)in[i]=nextLong();
	        return in;
		}
		public String nextLine() throws IOException {
			return br.readLine();
		}
	 
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
	 
		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
	 
		public char nextChar() throws IOException {
			return next().charAt(0);
		}
	 
		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}
	 
		public boolean ready() throws IOException {
			return br.ready();
		}
	 
		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
		
	}
	static void shuffle(int[]in) {
		for(int i=0;i<in.length;i++) {
			int idx=(int)(Math.random()*in.length);
			int tmp=in[i];
			in[i]=in[idx];
			in[idx]=tmp;
		}
	}
	static void shuffle(long[]in) {
		for(int i=0;i<in.length;i++) {
			int idx=(int)(Math.random()*in.length);
			long tmp=in[i];
			in[i]=in[idx];
			in[idx]=tmp;
		}
	}
}