#include<bits/stdc++.h>
#define fi first
#define se second
//#define int ll
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
int mod = 1e9 + 7, mod2 = 998244353;
const long long LNF = 0x3f3f3f3f3f3f3f3f;
const int N = 4e6 + 10, INF = 0x3f3f3f3f;
ll n, m, k;
int qmi(int a, int b) {
	ll res = 1;
	while (b) {
		if (b & 1)res = res * a % mod;
		a = (ll)a * a % mod;
		b >>= 1;
	}
	return res;
}
ll a[N], b[N];
void solve() {
	map<PII, int>mp;
	ll n, k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		for (int j = i; j <= i + 1 && j <= n; j++) {
			cout << i << " " << j << '\n';
			k--;
			mp[ {i, j}] = 1;
		}
	}
	cout << n << " " << 1 << '\n';
	k--;
	mp[ {n, 1}] =  1;
	for (int i = 1; i <= n && k; i++) {
		for (int j = 1; j <= n && k; j++) {
			if (mp[ {i, j}] == 0) {
				cout << i << " " << j << '\n';
				k--;
			}
		}
	}
}
signed main() {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cout << fixed << setprecision(2);
	int T = 1;
//	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}