#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define EACH(i, c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s, e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())

//#define LOCAL 0
//#ifdef LOCAL
//#define DEBUG(s) cout << (s) << endl
//#define dump(x)  cerr << #x << " = " << (x) << endl
//#define BR cout << endl;
//#else
//#define DEBUG(s) do{}while(0)
//#define dump(x) do{}while(0)
//#define BR
//#endif


//改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30)
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007
//ここから編集する


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N,M;
    cin >> N >> M;

    if( M > N*(N-1)/2 || M < N - 1){
        cout << "NO" << endl;
        return 0;
    }
    if(N % 2 == 0){
        if(M > ((N-1)/2)*((N-1)/2+1) ){
            cout << "NO" << endl;
            return 0;
        }
        if(M > ((N-1)/2)*((N-1)/2+1) + (N-1)/2){
            cout << "NO" << endl;
            return 0;
        }
    }

    vector<int> a(N);
    if(N % 2){
        int cnt = 0;
        rep(i,0,(N-1)/2+1){
//            a.push_back(++cnt);
            a[2*i] = ++cnt;
        }
        cnt = 250000;
        rep(i,0,(N-1)/2){
//            a.push_back(++cnt);
            a[2*i+1] = ++cnt;
        }
    }else{
        int cnt = 0;
        rep(i,0,N/2){
//            a.push_back(++cnt);
            a[2*i] = ++cnt;

        }
        cnt = 250000;
        rep(i,0,N/2){
//            a.push_back(++cnt);
            a[2*i+1] = ++cnt;
        }
    }
    vector<pair<int,int> > vp;
    int dist = 1;
    int pt = 0;
    while(M > 0){
        M--;
        if(pt + dist >= N){
            pt = 0;
            dist += 2;
        }
        vp.emplace_back(pt,pt+dist);
        pt += dist;
    }

    cout << "YES" << endl;
    rep(i,0,N){
        cout << a[i];
        if(i == N-1) cout << endl;
        else cout << " ";
    }
    rep(i,0,vp.size()){
        cout << vp[i].first + 1 << " " << vp[i].second + 1 << endl;
    }

    return 0;
}