import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const M = readInt; const N = readInt; auto A = new int[][](M, N); { int a; foreach (x; 0 .. M) foreach (y; 0 .. N) if (!((x + y) & 1)) { A[x][y] = ++a; } foreach_reverse (x; 0 .. M) foreach_reverse (y; 0 .. N) if ((x + y) & 1) { A[x][y] = ++a; } } foreach (x; 0 .. M) { foreach (y; 0 .. N) { if (y) write(" "); write(A[x][y]); } writeln; } debug { writeln("----"); foreach (x; 0 .. M - 1) { foreach (y; 0 .. N - 1) { if (y) write(" "); write(A[x][y] + A[x][y + 1] + A[x + 1][y] + A[x + 1][y + 1]); } writeln; } writeln("========"); } } } catch (EOFException e) { } }