#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define all(x) (x).begin(),(x).end()

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    for (int i = 0; i < int(v.size()); i++) cout << v[i] << (i + 1 == int(v.size()) ? "\n" : " ");
    return os;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, k;
    cin >> n >> k;
    vector<pair<int, int>> ans(k);
    set<pair<int, int>> st;
    for (int i = 0; i < 2 * n - 1; i++) {
        ans[i] = make_pair(i / 2, (i + 1) / 2);
        st.emplace(ans[i]);
    }
    ans[2 * n - 1] = make_pair(n - 1, 0);
    st.emplace(ans[2 * n - 1]);
    int a = 0, b = 0;
    for (int i = 2 * n; i < k; i++) {
        while (st.count(make_pair(a, b))) {
            b++;
            if (b == n) {
                b = 0;
                a++;
            }
        }
        ans[i] = make_pair(a, b);
        st.emplace(a, b);
    }
    for (auto [x, y]: ans) {
        cout << x + 1 << " " << y + 1 << '\n';
    }
    return 0;
}