#include <bits/stdc++.h>
using namespace std;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
using Int = long long;
const char newl = '\n';


template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}


struct TopologicalSort{
  vector< set<int> > G;
  vector<int> used,indeg,ps;

  TopologicalSort(){}
  TopologicalSort(int n):G(n),used(n,0),indeg(n,0){}

  void add_edge(int s,int t){
    G[s].emplace(t);
    indeg[t]++;
  }

  void bfs(int s){
    queue<int> que;
    que.emplace(s);
    used[s]=1;
    while(!que.empty()){
      int v=que.front();que.pop();
      ps.emplace_back(v);
      for(int u:G[v]){
        indeg[u]--;
        if(indeg[u]==0&&!used[u]){
          used[u]=1;
          que.emplace(u);
        }
      }
    }
  }

  vector<int> build(){
    int n=G.size();
    for(int i=0;i<n;i++)
      if(indeg[i]==0&&!used[i]) bfs(i);
    return ps;
  }
};

//INSERT ABOVE HERE
signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  int n,k;
  cin>>n>>k;

  if(n*(n-1)<k) drop("No");
  cout<<"Yes"<<newl;
  if(n==1) drop(0);

  auto idx=[&](int i,int j){return i*n+j;};
  TopologicalSort G(n*n);

  auto gen=[&](int x){
    assert(0<=x and x<n);
    vector<int> vs(n,-1);
    vs[n-(x+1)]=n-1;
    for(int i=0,j=0;i<n;i++)
      if(vs[i]<0) vs[i]=j++;
    return vs;
  };

  auto rev=[&](vector<int> vs){
    int n=vs.size();
    vector<int> rs(n);
    for(int i=0;i<n;i++) rs[vs[i]]=i;
    return rs;
  };

  if(k<=n*(n-1)/2){
    for(int i=0;i+1<n;i++)
      for(int j=0;j<n;j++)
        G.add_edge(idx(i,j),idx(i+1,j));
  }else{
    for(int j=0;j<n;j++){
      auto vs=gen(n-(j+1));
      auto rs=rev(vs);
      for(int i=0;i+1<n;i++)
        G.add_edge(idx(rs[i],j),idx(rs[i+1],j));
    }
    k-=n*(n-1)/2;
  }

  vector<int> ord(n);
  iota(ord.begin(),ord.end(),0);

  while(k){
    for(int i=0;i+1<n;i++)
      if(k and ord[i]<ord[i+1]) swap(ord[i],ord[i+1]),k--;
  }

  for(int i=0;i<n;i++){
    auto vs=gen(ord[i]);
    auto rs=rev(vs);
    for(int j=0;j+1<n;j++)
      G.add_edge(idx(i,rs[j]),idx(i,rs[j+1]));
  }

  auto vs=G.build();
  assert((int)vs.size()==n*n);
  auto rs=rev(vs);
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      if(j) cout<<' ';
      cout<<rs[idx(i,j)];
    }
    cout<<newl;
  }
  return 0;
}