// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
// #define debug
int n, k;
std::set<std::pair<int, int>> set;
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n >> k;
    for (int i = 1; i <= n << 1; ++i)
    {
        static int x = 1, y = 1;
        std::cout << x << ' ' << y << '\n';
        set.insert({x, y});
        if (i & 1)
        {
            ++x;
            if (x > n)
                x -= n;
        }
        else
        {
            ++y;
            if (y > n)
                y -= n;
        }
    }
    for (int i = n << 1 | 1; i <= k; ++i)
    {
        static int x = 1, y = 1;
        while (set.count({x, y}))
        {
            ++y;
            if (y > n)
                y -= n, ++x;
        }
        std::cout << x << ' ' << y << '\n';
        set.insert({x, y});
    }
    return 0;
}