#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

int N,K;
int P[1000];

void calcP(int n,int k){
  rep(i,n) P[i]=i;
  int x=n-1;
  while(k>x){ P[n-1-x]=x; k-=x; x--; }
  rep(i,x+1) P[N-x-1+i]=i;
  for(int i=n-1; i>0; i--) if(k){ swap(P[i-1],P[i]); k--; }
}

int main() {
  scanf("%d%d",&N,&K);
  if(N*(N-1)<K){ printf("No\n"); return 0; }
  printf("Yes\n");
  bool big = N*(N-1)/2<=K;
  if(big) K-=N*(N-1)/2;
  calcP(N,K);
  rep(i,N){
    rep(j,N){
      int iv,jv;
      iv=(big?N-1-i:i);
      if(P[i]>j) jv=j+1; else if(P[i]==j) jv=0; else jv=j;
      if(j) printf(" "); printf("%d",iv*N+jv);
    }
    printf("\n");
  }
  return 0;
}