#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(0), cin.tie(0)
#define int long long
#define ll long long
#define int128 __int128
#define ull unsigned long long
#define endl "\n"
#define pi acos(-1)
#define pii pair<int, int>
const double eps = 1e-6;
const int N = 1e6 + 10, M = 1010, INF = 0x3f3f3f3f;
const int mod = 998244353;

void solve()
{
    int n, k;
    cin >> n >> k;
    vector<pii> ans;
    for (int i = 1; i < n; i++)
    {
        ans.push_back({i, i});
        ans.push_back({i, i + 1});
    }
    ans.push_back({n, n});
    ans.push_back({n, 1});
    int now = k - ans.size();
    for (int i = 1; i <= n; i++)
    {
        if (now == 0)
            break;
        if (i < n)
        {
            for (int j = 1; j <= n; j++)
            {
                if (j == i || j == i + 1)
                    continue;
                ans.push_back({i, j});
                now--;
                if (now == 0)
                {
                    break;
                }
            }
        }
        else
        {
            for (int j = 1; j <= n; j++)
            {
                if (j == 1 || j == i)
                    continue;
                ans.push_back({i, j});
                now--;
                if (now == 0)
                {
                    break;
                }
            }
        }
        if (now == 0)
            break;
    }
    for (auto [x, y] : ans)
        cout << x << " " << y << endl;
}
signed main()
{
    ios;
    int T = 1;
    // cin >> T;
    // cout << fixed << setprecision(8);
    for (int i = 1; i <= T; i++)
    {
        // cout << "Case " << i << ": ";
        solve();
    }

    return 0;
}