//
// Created by DELLPC on 2023/11/10.
//
#include<bits/stdc++.h>

using namespace std;
#define ll long long
unordered_set<ll>s;
int n, k, cur;
ll tot, xx, yy;
ll get (ll x, ll y){
    return (x - 1) * n + y - 1;
}
void append(int x, int y){
    cout << x << ' ' << y << '\n';
    s.insert(get(x, y));
}

void get_xy(){
    while(s.contains(tot))++ tot;
    xx = tot / n + 1, yy = (tot % n) + 1;
}

int main(){
    cin >> n >> k;
    if(n & 1){
        append(1, 1);
        append(1, 2);
        append(2, 2);
        append(2, 3);
        append(3, 3);
        append(3, 1);
        int res = k - 6;
        for(int i = 4; i <= n; i += 2){
            append(i, i);
            append(i, i + 1);
            append(i + 1, i + 1);
            append(i + 1, i);
            res -= 4;
        }
        while(res --){
            get_xy();
            append(xx, yy);
        }
    }else{
        int res = k;
        for(int i = 1; i <= n; i += 2){
            append(i, i);
            append(i, i + 1);
            append(i + 1, i + 1);
            append(i + 1, i);
            res -= 4;
        }
        while(res --){
            get_xy();
            append(xx, yy);
        }
    }
    return 0;
}