#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define pii pair<int,int>

const int N = 1e6 + 5;

int n,k;
pair<int,int> pos[N];

void solve(){
    cin>>n>>k;
    int now=1;
    for(int i=1;i<=n;i++){
        pos[now++]={i,i};
        if(i!=n)
            pos[now++]={i,i+1};
        else
            pos[now++]={i,1};
    }
    if(now<=k){
        for(int i=1;i<=n&&now<=k;i++){
            for(int j=1;j<=n&&now<=k;j++){
                if(j==i||j==i+1||(i==n&&j==1))
                    continue;
                pos[now++]={i,j};
            }
        }
    }
    for(int i=1;i<=k;i++){
        cout<<pos[i].first<<' '<<pos[i].second<<endl;
    }
    return;
}

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