#include <bits/stdc++.h>

template <class _Tp = int>
_Tp read() {
    _Tp ret = 0;
    char ch = getchar(), sgn = 0;
    while (!isdigit(ch)) sgn |= ch == '-', ch = getchar();
    while (isdigit(ch)) ret = ret * 10 + ch - '0', ch = getchar();
    return sgn ? -ret : ret;
}

const int kMaxK = 1e6 + 5;
typedef std::pair<int, int> pii;
int n, k;

bool inuse(int x, int y) {
    if (y == x + 1 || y == x || (x == n && y == 1))
        return true;
    return false;
}

std::pair<int, int> ans[kMaxK];
int main() {
    n = read();
    k = read();
    for (int i = 1; i <= n; i++)
        ans[i * 2 - 1] = pii(i, i);
    for (int i = 1; i < n; i++)
        ans[i * 2] = pii(i, i + 1);
    ans[n * 2] = pii(n, 1);
    int j = 2 * n + 1;
    for (int x = 1; x <= n && j <= k; x++)
        for (int y = 1; y <= n && j <= k; y++)
            if (!inuse(x, y)) {
                ans[j] = pii(x, y);
                j++;
            }
    for (int i = 1; i <= k; i++)
        printf("%d %d\n", ans[i].first, ans[i].second);
    return 0;
}