#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;

    vector<pair<int, int>> res;
    
    int j = 0;
    vector<vector<int>> st(n + 1, vector<int> (n + 1));
    for(int i = 1;i <= n; i ++)
    {
        res.push_back({i, i});
        if(i != n)
        res.push_back({i, i + 1}), st[i][i + 1] = true;
        else    
            res.push_back({i, 1}),  st[i][1] = true;
        st[i][i] = 1;
    }

    vector<pair<int, int>> nop;
    for(int i = 1;i <= n; i ++)
        for(int j = 1;j <= n; j ++)
            if(!st[i][j])   nop.push_back({i, j});
    

    while(res.size() < k)
    {
        res.push_back(nop.back());
        nop.pop_back();
    }

    for(auto [x, y] : res)
        cout << x << ' ' << y << '\n';
    return 0;

}