#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;

void Main() {
  int n,m;
  cin >> n >> m;
  vector<int> v[2];
  rep(i,n) {
    if(i<n/2+n%2) v[0].pb(i+1);
    else v[1].pb(i+1);
  }
  vector<P> ans;
  ans.pb(P(v[0][0],v[1][0]));
  rep(j,2)REP(i,1,v[j].size()) ans.pb(P(v[j][i],j%2+1));
  REP(i,1,v[0].size()) {
    REP(j,1,v[1].size()) {
      if(ans.size()<m) ans.pb(P(v[0][i],v[1][j]));
    }
  }
  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;}