//
// Convert winner determination problem to a weighted graph
//
import java.util.*;
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;

public class Convert {

    public static void main(String[] args)  throws IOException {

	Scanner sc = new Scanner(new File(args[0]));
	String s = sc.nextLine();
	StringTokenizer st = new StringTokenizer(s);
	int m = Integer.parseInt(st.nextToken()); // number of items to bid for
	int n = Integer.parseInt(st.nextToken()); // number of bids
	BitSet[] items = new BitSet[n]; // the items bid for by each agent
	for (int i=0;i<n;i++) items[i] = new BitSet(m);
	System.out.println("p edge "+ n + " 0");
	//System.out.println(n +" 1 99999");
	for (int i=0;i<n;i++){
	    s = sc.nextLine();
	    st = new StringTokenizer(s);
	    BigDecimal bid = new BigDecimal(st.nextToken()).multiply(new BigDecimal(1000));
	    System.out.println("n "+ (i+1) +" "+ bid.toBigInteger().toString());
	    //System.out.println("n "+ (i+1) +" "+ st.nextToken());
	    while (st.hasMoreTokens()){
		int j = Integer.parseInt(st.nextToken()) - 1;
		items[i].set(j);
	    }
	    //System.out.println(items[i]);				 
	}
	BitSet newB = null;
	for (int i=0;i<n-1;i++)
	    for (int j=i+1;j<n;j++){
		newB = (BitSet)items[i].clone();
		newB.and(items[j]);
		if (newB.cardinality() == 0) System.out.println("e "+ (i+1) +" "+ (j+1));
	    }
    }
}