// package other2017.codefestival2017.finale;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Set;

public class Main {
    public static void main(String[] args) {
        // InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);

        int k = 38;
        int n = k*k-(k-1);
        int[][] table = new int[n][k];
        for (int i = 0; i < k ; i++) {
            table[i][0] = 0;
        }
        for (int i = 0; i < k-1; i++) {
            for (int j = 0; j < k-1; j++) {
                table[k+i*(k-1)+j][0] = i+1;
            }
        }
        for (int i = 1 ; i < n  ; i++) {
            table[(i-1)/(k-1)][(i-1)%(k-1)+1] = i;
        }

        for (int i = 0; i < k-1 ; i++) {
            int thead = k + i * (k-1);
            int cnt = 0;
            int co = 1;
            int ro = 0;
            for (int j = k ; j < n ; j++) {
                table[thead+(ro+cnt)%(k-1)][co] = j;
                cnt++;
                if (cnt % (k-1) == 0) {
                    ro += i;
                    ro++;
                    co++;
                }
            }
        }

        out.println(String.format("%d %d", n, k));
        for (int i = 0; i < n ; i++) {
            StringBuilder line = new StringBuilder();
            for (int j = 0; j < k ; j++) {
                line.append(' ').append(table[i][j]+1);
            }
            out.println(line.substring(1));
        }


        // verify(n, k, table);

        out.flush();
    }

    public static boolean verify(int n, int k, int[][] table) {
        int[] deg = new int[n+1];
        for (int i = 0; i < table.length; i++) {
            for (int j = 0; j < table[0].length; j++) {
                deg[table[i][j]]++;
            }
        }

        debug(deg);

        for (int i = 0; i < table.length; i++) {
            for (int j = i+1; j < table.length; j++) {
                Set<Integer> aset = new HashSet<>();
                for (int ll = 0; ll < table[i].length ; ll++) {
                    aset.add(table[i][ll]);
                    aset.add(table[j][ll]);
                }
                if (aset.size() != 2*k-1) {
                    debug(i, j);
                    throw new RuntimeException("no");
                }
            }
        }

        return true;
    }

    public static void debug(Object... o) {
        System.err.println(Arrays.deepToString(o));
    }

    public static class InputReader {
        private static final int BUFFER_LENGTH = 1 << 12;
        private InputStream stream;
        private byte[] buf = new byte[BUFFER_LENGTH];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        private int next() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public char nextChar() {
            return (char) skipWhileSpace();
        }

        public String nextToken() {
            int c = skipWhileSpace();
            StringBuilder res = new StringBuilder();
            do {
                res.append((char) c);
                c = next();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public int nextInt() {
            return (int) nextLong();
        }

        public long nextLong() {
            int c = skipWhileSpace();
            long sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = next();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = next();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public double nextDouble() {
            return Double.valueOf(nextToken());
        }

        int skipWhileSpace() {
            int c = next();
            while (isSpaceChar(c)) {
                c = next();
            }
            return c;
        }

        boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
    }
}

Measured memory_bytes: 23252