#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }


int main() {
  ll N, K; cin >> N >> K;
  if (N*(N-1)<K) { cout << "No" << endl; return 0; }
  else cout << "Yes" << endl;

  ll A[N][N]; rep(i,N) fill_n(A[i],N,0);
  if (K%2==0) {
    K /= 2;
    rep(i,N) if (K>=N-(i+1)) { A[i][i] = 1; K -= N-(i+1); }
  }
  else {
    if (N==4&&K==9) {
      A[0][0] = 1; A[1][2] = 1;
    }
    else if (K==3) A[N-2][N-3] = 1;
    else if (K==N*(N-1)-3) {
      rep(i,N) A[i][i] = 1;
      A[1][2] = 1;
    }
    else {
      A[N-2][N-2] = 1;
      A[N-1][N-2] = 1; A[N-1][N-1] = 1;
      K = (K-1) / 2;
      rep(i,N-2) if (K>=N-(i+1)&&K-(N-(i+1))!=1) { A[i][i] = 1; K -= N-(i+1); }
    }
  }
  rep(i,N) debug(A[i],A[i]+N);
  return 0;
}