#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    int k; cin >> k;
    int x = 0, y = 0;
    set<pair<int,int>> st;
    for (int i = 0; i < 2*n; ++i) {
        cout << x+1 << " " << y+1 << "\n";
        st.insert({x+1,y+1});
        if (i%2 == 0) {
            x += 1; if (x == n) x = 0;
        }
        else {
            y += 1; if (y == n) y = 0;
        }
    }
    x = 1, y = 1;
    for (int i = 0; i < k-2*n; ++i) {
        while (1) {
            if (st.find({x,y}) == st.end()) break;
            if (y == n) {
                y = 1, x += 1;
            }
            else {
                y += 1;
            }
        }
        cout << x << " " << y << "\n";
        if (y == n) {
            y = 1, x += 1;
        }
        else {
            y += 1;
        }
    }
}