#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = x; i <= y; ++i)
#define per(i, x, y) for (int i = x; i >= y; --i)
#define ll long long
#define pii pair<int, int>
inline ll read()
{
    ll x = 0, f = 1; char ch = getchar();
    while (!isdigit(ch)) {if (ch == '-') f = -f; ch = getchar();}
    while (isdigit(ch)) {x = x * 10 + ch - 48; ch = getchar();}
    return x * f;
}
void solve()
{
    int n = read(), k = read();
    map<pii, bool> mp;
    auto go = [&](int x, int y)
    {
        mp[{x, y}] = 1;
        cout << x << ' ' << y << '\n';
    };
    go(1, 1), go(1, n);
    per(i, n, 2)
    {
        go(i, i);
        go(i, i - 1);
    }
    int x = 1, y = 1;
    auto find = [&]()
    {
        while (mp[{x, y}])
        {
            if (y == n)
            {
                y == 1;
                x += 1;
            }
            else ++y;
        }
        go(x, y);
    };
    rep(i, 2 * n + 1, k) find();

}
int main()
{
    int t = 1;
    while (t--)
    {
        solve();
        putchar('\n');
    }
}