#include using namespace std; #define REP(i,n) for(int i=0;i<(int)(n);++i) #define REPR(i,n) for (int i=(int)(n)-1;i>=0;--i) #define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i) #define ALL(c) (c).begin(), (c).end() #define valid(y,x,h,w) (0<=y&&y pii; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (bbasic_ostream& operator<<(basic_ostream&os, const C& c){os<<'[';for(auto i=begin(c);i!=end(c);++i)os<<(i==begin(c)?"":" ")<<*i;return os<<']';} templateostream&operator<<(ostream &o,const pair&t){return o<<'('<void output(ostream&,const Tp&){} templatevoid output(ostream &o,const Tp&t){if(N)o<<',';o<(t);output(o,t);} templateostream&operator<<(ostream&o,const tuple&t){o<<'(';output<0,tuple,Ts...>(o,t);return o<<')';} templatevoid output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20]; int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);} templatevoid outputs(T t){output(t);} templatevoid outputs(S a,T...t){output(a,32);outputs(t...);} templatevoid output(T *a,int n){REP(i,n)cout<void output(T *a,int n,int m){REP(i,n)output(a[i],m);} templatebool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;); if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;} templatebool input(S&a,T&...t){input(a);return input(t...);} templatebool inputs(T *a, int n) { REP(i,n) if(!input(a[i])) return 0; return 1;} int v4[4][4] = {1,8,13,12, 14,11,2,7, 4,5,16,9, 15,10,3,6}; int v8[8][8] = {33 , 26 , 35 , 28 , 40 , 31 , 38 , 29, 48 , 23 , 46 , 21 , 41 , 18 , 43 , 20, 49 , 10 , 51 , 12 , 56 , 15 , 54 , 13, 64 , 7 , 62 , 5 , 57 , 2 , 59 , 4, 25 , 34 , 27 , 36 , 32 , 39 , 30 , 37, 24 , 47 , 22 , 45 , 17 , 42 , 19 , 44, 9 , 50 , 11 , 52 , 16 , 55 , 14 , 53, 8 , 63 , 6 , 61 , 1 , 58 , 3 , 60}; int v16[16][16]; int ans[16][16]; int main() { REP(i,16) { REP(j,16) { v16[i][j] = (v4[i/4][j/4]-1) * 16 + v4[i%4][j%4]; } } int n,x,y,z; while(input(n,x,y,z)) { auto v = vector>(n,vector(n)); if (n == 4) REP(i,n)REP(j,n) v[i][j]=v4[i][j]; else if (n == 8) REP(i,n)REP(j,n) v[i][j]=v8[i][j]; else REP(i,n)REP(j,n) v[i][j]=v16[i][j]; y--;x--; int Y=-1,X=-1; REP(i,n)REP(j,n) { if (v[i][j]==z) { Y = i, X = j; } } REP(i,n) REP(j,n) { ans[i][j] = v[(i+Y-y+n)%n][(j+X-x+n)%n]; } // cout << tpl(n,y,x,z,Y,X) << endl; int sum = 0; REP(i,n) sum += ans[0][i]; int s1 = 0, s2 = 0; REP(i,n) { s1 += ans[i][i]; s2 += ans[n-i-1][i]; } assert(sum==s1); assert(sum==s2); REP(i,n) { int s1 = 0, s2 = 0; REP(j,n) { s1 += ans[i][j]; s2 += ans[j][i]; } assert(sum == s1); assert(sum == s2); } assert(ans[y][x] == z); // REP(i,n) { // REP(j,n) printf("%d%c", ans[i][j], j!=n-1?' ':'\n'); // } } }