#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n,m;

int main(){
  cin>>n>>m;
  if(m < n-1){
    puts("NO");
    return 0;
  }
  if((ll)m > (ll)(n/2) * (ll)((n+1)/2)){
    puts("NO");
    return 0;
  }
  puts("YES");
  REP(i,n)printf("%d%c",i+1,i==n-1?'\n':' ');
  int la = 0, lb = (n+1)/2;
  int ha = (n+1)/2, hb = n;
  while(m>0){
    FOR(i,ha,hb){
      printf("%d %d\n",la+1,i+1);
      m--;
      if(m==0)break;
    }
    if(m==0)break;
    la++;
    FOR(i,la,lb){
      printf("%d %d\n",i+1,hb);
      m--;
      if(m==0)break;
    }
    hb--;
  }
  return 0;
}