import java.util.*;

public class RandomWeightedGraph {

    static int n;
    static double p;
    static int minWeight;
    static int maxWeight;
    static Random gen;

    static void shuffle(int[] v,int n){
	int j, temp;
	for (int i=n-1;i>0;i--){
	    j = gen.nextInt(i+1);
	    temp = v[i];
	    v[i] = v[j];
	    v[j] = temp;
	}
    }
    //
    // Knuth shuffle
    //

    public static void main(String[] args) {
	if (args.length < 2) {
	    System.out.println("PARAMS: n vertices, p edge probability, min weight, max weight");
	    return;
	}
	n         = Integer.parseInt(args[0]);
	p         = Double.parseDouble(args[1]);
	minWeight = Integer.parseInt(args[2]);
	maxWeight = Integer.parseInt(args[3]);
	gen       = new Random();

	System.out.println("p edge "+ n + " 0");

	// generate n vertices with weights in range minWeight to maxWeight inclusive
	for (int i=0;i<n;i++)
	    System.out.println("n "+ (i+1) +" "+ (gen.nextInt(maxWeight - minWeight + 1) + minWeight));

	// generate random edges with probability p
	for (int i=0;i<n-1;i++)
	    for (int j=i+1;j<n;j++)
		if (gen.nextDouble() <= p) System.out.println("e "+ (i+1) +" "+ (j+1));
    }
}