#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<bitset>
#include<random>
#define INF 1000000000ll
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; }
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll n,m;
	cin>>n>>m;
	ll n1=n/2,n2=n-n/2;
	if(m>n1*n2) {
		cout<<"NO"<<endl;
		return 0;
	}
	vector<ll> a(n);
	vector<P> ed;
	ll buf=1;
	REP(i,n1) {
		a[i]=buf;
		buf++;
	}
	REP(i,n2) {
		a[n1+i]=buf;
		buf++;
	}
	ll nokori=m;
	REP(i,n1) {
		FOR(j,n1,n) {
			if(nokori>0) {
				ed.pb(P(i,j));
				nokori--;
			} else {
				REP(k,n) {
					cout<<a[k];
					if(k!=n-1) cout<<" ";
					else cout<<endl;
				}
				REP(k,(ll)ed.size()) {
					cout<<ed[k].first<<" "<<ed[k].second<<endl;
				}
				return 0;
			}
		}
	}
}