// This program prints the solution for the easy version of Assignment 1
// in YUFAFF.
// To number the states, we let state s represent (even, s) and state 10+s
// represent (odd s).

import java.io.PrintStream;
    
public class A1RevGen {
    static final PrintStream out = System.out;

    public static void printTransition(int oldq, int a, int newq) {
	out.print(oldq);
	out.print(" ");
	out.print(a);
	out.print(" ");
	out.println(newq);
    }

    public static int f(int x) {
	return (2*x >= 10 ? 2*x-9 : 2*x);
    }
    
    public static void main(String[] args) {
	out.println("20 10 2 200");
	out.println("0 1 2 3 4 5 6 7 8 9");
	out.println("0 10");
	for (int s = 0; s < 10; s++)
	    for (int d = 0; d < 10; d++) {
		// Print transition delta((even, s), d) = (odd, (s+d) mod 10)
		printTransition(s, d, 10 + (s+d)%10);
		// Print transition delta((odd, s), d) = (even, (s+f(d)) mod 10)
		printTransition(10+s, d, (s+f(d))%10);
	    }
    }
}