#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <cassert>
using namespace std;
typedef long long ll;
ll N,M;
int A[100010];
vector<pair<int,int>> ans;
int main(){
    cin >> N >> M;
    if(M<N-1){
        cout << "NO" << endl;
        return 0;
    }
    ll k = (N+1)/2;
    if((k%2==0 && k*k<M) || (k%2==1 && k*(k-1)<M)){
        cout << "NO" << endl;
        return 0;
    }
    cout << "YES" << endl;
    for(int i=1;i<=N;i++){
        cout << i << (i!=N? " ":"\n");
    }
    map<pair<int,int>,int> m;
    for(int i=1;i<=k;i++){
        if(!(N%2==1 && i==k)){
            ans.push_back({i,i+k});
            m[{i,i+k}]++;
        }
        if(i!=1){
            ans.push_back({i,i+k-1});
            m[{i,i+k-1}]++;
        }
    }
    M -= N-1;
    assert(N-1==m.size());
    int s_id = 1,b_id = k+1;
    while(M>0){
        int a = s_id,b = b_id;
        if(a>b) swap(a,b);
        //cerr << a << " " << b << endl;
        if(m.count({a,b})){
            b_id++;
            if(b_id>N){
                s_id++;
                b_id = k+1;
            }    
            continue;
        }
        ans.push_back({a,b});
        m[{a,b}]++;
        M--;
        b_id++;
        if(b_id>N){
            s_id++;
            b_id = k+1;
        }
    }
    for(auto x:ans) cout << x.first << " " << x.second << endl;
}