#include <bits/stdc++.h>
#define int long long
using namespace std;
void solve();
signed main(){
    cin.sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    //cin >> T;
    while(T--){
        solve();
    }
    return 0;
}
void solve(){
    int n, k;
    cin >> n >> k;
    //vector<vector<int>> g(n + 1, vector<int>(n + 1, 0));
    vector<pair<int,int>> ans;
    
    for(int i = 1;i <= n;i++){
        ans.push_back({i, i});
        if(i < n)ans.push_back({i, i + 1});
    }
    //ans.push_back({1, n});
    ans.push_back({n, 1});
    set<pair<int,int>>st(ans.begin(),ans.end());
    k-=2*n;
    for(int i=1;i<=n;i++) {
        for(int j=1;j<=n;j++) {
            if(st.find({i,j})==st.end()) {
                if(k==0)break;
                k--;
                ans.push_back({i,j});               
            }
        }
        if(!k)break;
    }
    for(auto [i,j]:ans) {
        cout<<i<<" "<<j<<"\n";    
    }
}