#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#endif

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
using uint=unsigned;

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
#define a first
#define b second
#define mp make_pair
template<class t>using vc=vector<t>;

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b; return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(a>b){a=b; return true;}else return false;}

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u> &p){
	return os<<"{"<<p.a<<","<<p.b<<"}"<<endl;
}

template<class t> ostream& operator<<(ostream& os,const vector<t>& v){
	os<<"{";
	for(auto e: v)os<<e<<",";
	return os<<"}";
}

using P=pair<int,int>;

void solve(){
	int n,k;
	cin>>n>>k;
	set<pair<int,int>> used;
	for(int i=0;i<2*n;i++){
		int x=i/2;
		int y=x+(i%2);
		if(y==n)y=0;
		cout<<x+1<<" "<<y+1<<endl;
		used.insert(mp(x,y));
	}
	int nx=0,ny=0;
	for(int i=2*n;i<k;i++){
		while(used.find(mp(nx,ny))!=used.end()){
			ny++;
			if(ny==n){ nx++; ny=0; }
		}
		cout<<nx+1<<" "<<ny+1<<endl;
		used.insert(mp(nx,ny));
	}
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	solve();
}