#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

ll N, M;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N >> M;
    ll n = N/2;
    ll m = N-n;
    if(n*m < M || M < N-1){
        cout << "NO" << endl;
        return 0;
    }
    cout << "YES" << endl;
    for(int i = 1; i <= N; i++) {
        if(i%2 == 1) cout << (i+1)/2 << ' ';
        else cout << (N+1)/2+i/2 << ' ';
    }
    cout << endl;
    for(int i = 1; i <= N-1; i++) cout << i << ' ' << i+1 << endl;
    M -= N-1;
    if(M == 0) return 0;
    for(int i = 1; i <= N; i++){
        for(int j = i+3; j <= N; j+=2){
            cout << i << ' ' << j << endl;
            M--;
            if(M == 0) return 0;
        }        
    }
}