#include<bits/stdc++.h>

std::map<std::pair<int,int>,bool>M;
int n,k;
int main(){
	scanf("%d%d",&n,&k);
	int x=1,y=1;
	for(int i=1;i<n*2;i++){
		printf("%d %d\n",x,y);
		M[{x,y}]=true;
		if(i%2==1)y++;
		else x++;
	}
	printf("%d %d\n",n,1);
	M[{1,n}]=true;
	x=1,y=1;
	for(int i=2*n+1;i<=k;i++){
		while(M.find({x,y})!=M.end()){
			y++;
			if(y==n+1){x++,y=1;}
		}
		printf("%d %d\n",x,y);
	}
	
	return 0;
}