#include <bits/stdc++.h>

#define rep(i,s,n) for(int i = int(s); i < int(n); i++)
#define rrep(i,s,n) for(int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(), (v).end()

using ll = long long;
using ull = unsigned long long;
using ld = long double;

template<class T>
bool chmin(T &a, T b) {
    if(a <= b) return false;
    a = b;
    return true;
}

template<class T>
bool chmax(T &a, T b) {
    if(a >= b) return false;
    a = b;
    return true;
}

using namespace std;

void assertion(int n, int k, vector<pair<int,int>> p){
    vector<vector<int>> a(n, vector<int>(n));
    assert((int)p.size() == k);
    rep(i,0,(int)p.size()){
        assert (a[p[i].first][p[i].second] == 0);
        a[p[i].first][p[i].second] = i + 1;
    }
    rep(i,0,n){
        int g = 0;
        int cnt = 0;
        rep(j,0,n){
            g = __gcd(a[i][j], g);
            if(a[i][j] != 0) cnt++;
        }
        assert(cnt >= 2);
        int g2 = 0;
        cnt = 0;
        rep(j,0,n){
            g2 = __gcd(a[j][i], g2);
            if (a[j][i] != 0) cnt++;
        }
        assert(cnt >= 2);
        assert (g == g2);
    }
}

int main() {
    int n, k; cin >> n >> k;
    vector<vector<int>> a(n, vector<int>(n));
    int x = 0;
    int y = 0;
    rep(i,0,2*n){
        if (i % 2 == 0){
            a[x][y] = i+1;
            x++;
            x%=n;
        }else{
            a[x][y] = i+1;
            if (i!=2*n-1) y++;
            y%=n;
        }
    }
    int piv = 2*n;
    rep(i,0,n){
        rep(j,0,n){
            if (piv>=k) break;
            if (a[i][j] == 0){
                a[i][j] = piv+1;
                piv++;
            }
        }
    }
    vector<pair<int,int>> ans(k);
    rep(i,0,n){
        rep(j,0,n){
            if (a[i][j] != 0){
                ans[a[i][j]-1] = pair(i, j);
            }
        }
    }
    //assertion(n,k,ans);
    auto output = [&](){
        rep(i,0,n){
            rep(j,0,n){
                cout << a[i][j] << ' ';
            }
            cout << endl;
        }
    };
    //output();
    rep(i,0,k){
        cout << ans[i].first+1 << ' ' << ans[i].second+1 << '\n';
    }
}