#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN = 1e6+10;

int n,k,x[MAXN],y[MAXN];
map<array<int,2>,int> f;

int main(){
	ios::sync_with_stdio(false);

	cin>>n>>k;

	//先考虑前2n个的构造

	rep(i,1,n)x[2*i-1] = x[2*i] = i;
	rep(i,1,n-1)y[2*i] = y[2*i+1] = i+1;
	y[1] = y[2*n] = 1;

	rep(i,1,2*n)f[{x[i],y[i]}] = 1;
		
	int cx = 1,cy = 1;
	rep(i,2*n+1,k){
		while(f.find({cx,cy}) != f.end()){
			if(cy<n)cy++;
			else cy=1,cx++;
		}
		f[{cx,cy}] = 1;
		x[i] = cx,y[i] = cy;
	}	

	rep(i,1,k){
		cout<<x[i]<<" "<<y[i]<<"\n";
	}

    return 0;
}