#include<bits/stdc++.h>
using namespace std;
typedef  long long LL;
typedef pair<int,int> PII;
const int N=100010,M=1000010;
const int mod=998244353;
int INF = 1e9;
int h[N],e[M],ne[M],idx;
int T=1;





void solve(){
    int n,k;

    cin>>n>>k;
    map<PII,int> mp;

    for(int i=1;i<=2*n;i++){
        int x=(i+1)/2,y;
        if(i%2) y=x;
        else y=x+1;
        if(i==2*n)  y=1;

        cout<<x<<" "<<y<<endl;
        mp[{x,y}]=true;

    }

    int x=1,y=1;
    for(int i=2*n+1;i<=k;i++){
        while(mp[{x,y}]){
            y++;
            if(y>n) x++,y-=n;
        }
    
        cout<<x<<" "<<y<<endl;
        mp[{x,y}]=true;
    }

}   
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //int T=1;
    //cin>>T;
    while(T--) solve();
 
    return 0;
}