#include int ri() { int n; scanf("%d", &n); return n; } int main() { int n = ri(); int k = ri(); if (k > n * (n - 1) * 2) { puts("No"); return 0; } assert((k & 1) == 0); k /= 2; int a[n]; std::iota(a, a + n, 0); int cur = n - 1, cnt = 0; while (k && k >= cur) { k -= cur; cur--, cnt++; } std::rotate(a, a + cnt, a + n); std::reverse(a + n - cnt, a + n); if (k) std::rotate(a, a + 1, a + k + 1); puts("Yes"); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (j) printf(" "); printf("%d", a[i] != j); } puts(""); } return 0; }