#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
    ll n, m;
    cin >> n >> m;

    ll x = n / 2, y = n - x;
    if (m > x * y || m < n-1){
        cout << "NO" << endl;
        return 0;
    }

    cout << "YES" << endl;
    REP(i,x) cout << i + 1 << endl;
    REP(i,y) cout << 100000 - i << endl;

    REP(i,x){
        cout << i + 1 << " " << x + 1 << endl;
        m--;
    }
    FOR(i,x+2,n){
        cout << i << " " << 1 << endl;
        m--;
    }

    FOR(i,2,x){
        FOR(j,x+2,n){
            if (m == 0) break;
            cout << i << " " << j << endl;
            m--;
        }
    }

    return 0;
}