#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define int long long
#define endl '\n'
#define lowbit(x) (x)&(-x)
#define pii pair<int,int>
#define all(s) s.begin(), s.end()
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
#define here system("pause")
using namespace std;
template <class T> inline void read(T& x) { x = 0; char c = getchar(); bool f = 0; for (; !isdigit(c); c = getchar()) f ^= (c == '-'); for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48); x = f ? -x : x; }
template <class T> inline void write(T x) { if (x < 0) putchar('-'), x = -x; if (x < 10) putchar(x + 48); else write(x / 10), putchar(x % 10 + 48); }
 
const int N = 1e5+5;
const int INF = 1e18;
const int mod = 998244353;
 
inline int pow(int a, int b, int p){ int res = 1%p; while(b){ if(b&1) res=res*a%p; a=a*a%p, b>>=1;} return res;}
inline int inv(int a, int p){ return pow(a,p-2,p)%p;}

int n, k, cnt = 0;
map<pii, int> mp;
inline void print(int x, int y){
	if(cnt==k) exit(0);
	cout << x << " " << y << endl;
	mp[{x, y}] = 1;
	++cnt;
}
inline void sol(){
	cin >> n >> k;
	int x = 1, y = 1;
	print(x, y);
	while(1){
		y+=1;
		print(x, y);
		x+=1;
		print(x, y);
		if(x==n && y==n) break;
	}
	print(n, 1);
	
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(cnt==k) return ;
			if(!mp.count({j, i})) print(j, i);
		}
		if(cnt==k) return ;
	} 
	
}

signed main(){
	IOS;
	int tc = 1;
	//cin >> tc;
	while(tc--){
		sol();
	}
	return 0;
}