#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
int p[100001],r[100001];
void init(){rep(i,100001)p[i]=i,r[i]=0;}
int find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));}
void unite(int x,int y) {
  x=find(x),y=find(y);
  if(x==y)return;
  if(r[x]<r[y])p[x]=y;
  else{p[y]=x;if(r[x]==r[y])r[x]++;}
}
bool same(int x,int y){return find(x)==find(y);}

void Main() {
  int n,m;
  cin >> n >> m;
  int nn=ceil(sqrt(n));
  int a[nn][nn];
  mem(a);
  int k=1;
  rep(l,2) {
    rep(i,nn) {
      rep(j,nn) {
        if(!l&&k>n/2) continue;
        if(k<=n&&(i+j+l)%2) a[i][j]=k++;
      }
    }
  }
  init();
  vector<P> v;
  rep(i,nn) {
    rep(j,nn) {
      REP(k,1,3) {
        int x=i+dx[k],y=j+dy[k];
        if(check(nn,nn,x,y)&&a[i][j]&&a[x][y]) v.pb(P(a[i][j],a[x][y]));
      }
    }
  }
  bool u[v.size()];
  mem(u);
  vector<P> ans;
  rep(i,v.size()) {
    int x=v[i].F,y=v[i].S;
    if(same(x,y)) continue;
    if(ans.size()<m) {
      unite(x,y);
      ans.pb(v[i]);
      u[i]=1;
    }
  }
  REP(i,2,n+1) {
    if(!same(1,i)) {
      pr("NO");
      return;
    }
  }
  rep(i,v.size()) {
    if(!u[i]&&ans.size()<m) {
      ans.pb(v[i]);
      u[i]=1;
    }
  }
  if(ans.size()!=m) pr("NO");
  else {
    pr("YES");
    rep(i,n) {
      if(i) cout << " ";
      cout << i+1;
    }
    ln;
    rep(i,m) pr(ans[i].F,ans[i].S);
  }
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}