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

public class Mike {
    static final int[] inverse = {0, 1, 16, 21, 8, 25, 26, 9, 4, 7, 28, 17, 13, 12, 20, 29, 2, 11, 19, 18, 14, 3, 24, 27, 22, 5, 6, 23, 10, 15, 30};

    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        String pass = sc.next();
        StringBuilder out = new StringBuilder();
        if ("send".equals(pass)) {
            long k = sc.nextLong();
            int k1 = (int) (k % 30) + 1;
            int k2 = (int) (k / 30) + 1;
            for (int x = 1; x <= 30; ++x) {
                int val = x + 31 * ((k1 * x + k2) % 31);
                out.append(val);
                if (x == 30) out.append('\n');
                else out.append(' ');
            }
        } else {
            int a = (int) sc.nextLong();
            int b = (int) sc.nextLong();
            int x1 = a % 31, y1 = a / 31, x2 = b % 31, y2 = b / 31;
            int k1 = (int) (((y2 - y1 + 31L) * inverse[(x2 - x1 + 31) % 31]) % 31);
            int k2 = (int) ((y1 - (long) k1 * x1 + 31L * 31) % 31);
            out.append((k1 - 1) + 30 * (k2 - 1)).append('\n');
        }
        System.out.print(out.toString());
    }
}