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() { debug { foreach (n; 1 .. 5 + 1) { auto perm = iota(n).array; do { int orig; foreach (i0; 0 .. n) foreach (i1; i0 + 1 .. n) { if (perm[i0] < perm[i1]) { ++orig; } } auto a = new int[][](n, n); foreach (i; 0 .. n) { a[i][perm[i]] = 1; } auto rows = new int[n]; auto cols = new int[n]; foreach (x; 0 .. n) { foreach (y0; 0 .. n) foreach (y1; y0 + 1 .. n) { if (a[x][y0] > a[x][y1]) { ++rows[x]; } } } foreach (y; 0 .. n) { foreach (x0; 0 .. n) foreach (x1; x0 + 1 .. n) { if (a[x0][y] > a[x1][y]) { ++cols[y]; } } } int total; foreach (x0; 0 .. n) foreach (x1; x0 + 1 .. n) { if (rows[x0] > rows[x1]) { ++total; } } foreach (y0; 0 .. n) foreach (y1; y0 + 1 .. n) { if (cols[y0] > cols[y1]) { ++total; } } writeln(perm, " ", rows, " ", cols, " ", total); assert(2 * orig == total); } while (perm.nextPermutation); } } try { for (; ; ) { const N = readInt(); const K = readInt(); if (0 <= K && K <= N * (N - 1)) { int k = (K + 1) / 2; auto perm = iota(N).array; foreach (_; 0 .. N - 1) { foreach (i; 0 .. N - 1) { if (perm[i] < perm[i + 1]) { if (k > 0) { --k; swap(perm[i], perm[i + 1]); } } } } debug { writeln("perm = ", perm); } auto ans = new int[][](N, N); foreach (x; 0 .. N) { ans[x][] = 3; ans[x][perm[x]] = 0; } if (K % 2 != 0) { assert(perm[0] != 0); ans[0][perm[0] - 1] = 1; ans[0][perm[0]] = 2; } writeln("Yes"); foreach (x; 0 .. N) { foreach (y; 0 .. N) { if (y > 0) write(" "); write(ans[x][y]); } writeln; } } else { writeln("No"); } } } catch (EOFException e) { } }