#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() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n, k; cin >> n >> k;
    //vector<vector<int>> a(n, vector<int>(n));
    set<pair<int,int>> st;
    int x = 0;
    int y = 0;

    vector<pair<int,int>> ans(k);
    int piv = 0;
    rep(i,0,2*n){
        if (i % 2 == 0){
            st.insert(pair(x, y));
            ans[piv] = pair(x, y);
            piv++;
            x++;
            x%=n;
        }else{
            st.insert(pair(x, y));
            ans[piv] = pair(x, y);
            piv++;
            y++;
            y%=n;
        }
    }
    rep(i,0,n){
        rep(j,0,n){
            if (piv>=k) break;
            if (st.find(pair(i,j)) == st.end()){
                st.insert(pair(i,j));
                ans[piv] = pair(i,j);
                piv++;
            }
        }
        if(piv>=k) break;
    }
    //assertion(n,k,ans);
    rep(i,0,k){
        cout << ans[i].first+1 << ' ' << ans[i].second+1 << '\n';
    }
}