#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
typedef pair<int, int> PII;
const int N = 1000010;
int mod = 998244353;
vector<PII> ans;
map<PII, int> mp;
void solve()
{
    int n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        ans.push_back({i, i});
        mp[{i, i}] = 1;
        if (i != n)
        {
            ans.push_back({i, i + 1});
            mp[{i, i + 1}] = 1;
        }
        else
        {
            ans.push_back({i, 1});
            mp[{i, 1}] = 1;
        }
    }
    int x = 1, y = 1;
    for (int i = 1; i <= k - 2 * n;)
    {
        if (mp[{x, y}] == 0)
        {
            ans.push_back({x, y});
            mp[{x, y}] = 1;
            i++;
        }
        else
        {
            x = (y == n ? x + 1 : x);
            y = (y == n ? 1 : y + 1);
        }
    }
    for (auto i : ans)
    {
        cout << i.first << " " << i.second << endl;
    }
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--)
        solve();
    return 0;
}