#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second

typedef long long ll;

const int N = 1e6 + 200;

int n, k;
pair<int, int> pos[N];
map<int, int> used[N];

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    cin >> n >> k;
    pos[1] = {n, 1};
    used[n][1] = 1;
    for (int i = 2; i <= n + n; ++i) {
        if (i % 2 == 0) {
            pos[i] = {i / 2, i / 2};
            used[i / 2][i / 2] = 1;
        }
        else {
            pos[i] = {i / 2, i / 2 + 1};
            used[i / 2][i / 2 + 1] = 1;
        }
    }
    int now = 2 * n + 1;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (now > k) break;
            if (used[i].count(j) == 0)
                pos[now++] = {i, j};
        }
        if (now > k) break;
    }
    for (int i = 1; i <= k; ++i)
        cout << pos[i].F << " " << pos[i].S << '\n';
    
}