#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define vec(...) vector<__VA_ARGS__>
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}

void slv(){
	int n;
	cin>>n;
	int k;
	cin>>k;
	map<pii,int> mp;
	vec(pii) a(k+1);
	int x=0,y=0,t=0;
	for(int i=1;i<=2*(n-1)+1;i++){
		a[i]={x,y};
		mp[{x,y}]=i;
		if(!t) x+=1;
		else y+=1;
		t^=1;
	}
	a[2*n]={0,n-1};
	mp[{0,n-1}]=2*n;
	int iter=2*n+1;
	rep(i,n){
		if(iter==k+1) break;
		int j=0;
		while(j<n){
			if(iter==k+1) break;
			if(mp.find({i,j})==mp.end()){
				a[iter]={i,j};
				mp[{i,j}]=iter++;
			}
			j+=1;
		}
	}
	for(int i=1;i<=k;i++){
		cout<<a[i].fi+1<<" "<<a[i].se+1<<"\n";
	}
}

signed main(){
	ios::sync_with_stdio(0),cin.tie(0);
	slv();
}