// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

int n, k;
set<ii> used;

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> k;
    int ur = 1, uc = 1;
    REP (i, 1, 2 * n + 1) {
        cout << ur << ' ' << uc << '\n';
        used.insert({ur, uc});
        k--;
        if (i & 1) {
            ur++;
            if (ur > n) {
                ur -= n;
            }
        } else {
            uc++;
        }
    }
    REP (i, 1, n + 1) {
        REP (j, 1, n + 1) {
            if (k == 0) {
                break;
            }
            if (used.find({i, j}) != used.end()) {
                continue;
            }
            cout << i << ' ' << j << '\n';
            k--;
        }
        if (k == 0) {
            break;
        }
    }
}