import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, 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; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int N, X, Y, Z;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      Y = readInt() - 1;
      X = readInt() - 1;
      Z = readInt();
      
      auto a = new int[][](N, N);
      foreach (x; 0 .. N) {
        if (x % 2 == 0) {
          a[x][0 .. N / 2] = iota(0, N / 2).array;
          a[x][N / 2 .. N] = iota(N / 2, N).array.reverse;
        } else {
          a[x][0 .. N / 2] = iota(N / 2, N).array.reverse;
          a[x][N / 2 .. N] = iota(0, N / 2).array;
        }
      }
      auto b = new int[][](N, N);
      foreach (x; 0 .. N) foreach (y; 0 .. N) {
        b[x][y] = 1 + a[x][y] + N * a[y][x];
      }
      int x0, y0;
      foreach (x; 0 .. N) foreach (y; 0 .. N) {
        if (b[x][y] == Z) {
          x0 = x;
          y0 = y;
        }
      }
      // b[x0][y0] -> output[X][Y]
      foreach (x; 0 .. N) {
        foreach (y; 0 .. N) {
          if (y > 0) {
            write(" ");
          }
          write(b[(x - X + x0 + N) % N][(y - Y + y0 + N) % N]);
        }
        writeln();
      }
    }
  } catch (EOFException e) {
  }
}