//code by Emissary
#include<bits/stdc++.h>

#define fi first
#define se second
#define vc vector
#define db double
#define ll long long
#define mk make_pair
#define pb push_back
#define PI pair<int,int>
#define ull unsigned long long
#define err cerr << "   -_-   " << endl
#define debug cerr << " ------------------- " << endl

#define input(x) freopen(#x".in","r",stdin)
#define output(x) freopen(#x".out","w",stdout)

#define NO puts("No")
#define YES puts("Yes")

//#define int long long

using namespace std;

namespace IO{
	inline int read(){
		int X=0, W=0; char ch=getchar();
		while(!isdigit(ch)) W|=ch=='-', ch=getchar();
		while(isdigit(ch)) X=(X<<1)+(X<<3)+(ch^48), ch=getchar();
		return W?-X:X;
	}
	inline void write(int x){
		if(x<0) x=-x, putchar('-');
		if(x>9) write(x/10);
		putchar(x%10+'0');
	}
	inline void sprint(int x){write(x), putchar(32);}
	inline void eprint(int x){write(x), putchar(10);}
}using namespace IO;

const int MAXN = 5e5+5;
const int mod = 998244353;
//const int mod = 1e9+7;

int n, k;

inline int nxt(int x){return x==n?1:x+1;}

signed main(){
	n=read(), k=read(); int now=1;
	for(int i=1;i<=2*(n-1);++i){
		if(i&1) sprint(now), eprint(now);
		else sprint(now), eprint(now+1), ++now;
	}
	sprint(now), eprint(now);
	sprint(now), eprint(1); k-=2*n;
	for(int i=1, j=2;i<=n;++i, j=nxt(j)){
		if(k){
			for(int o=1, t=nxt(j);o<=n-2 && k;++o, t=nxt(t)) k--, sprint(i), eprint(t);
		}
	}
	return 0;
}