#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define gcd __gcd
using namespace std;
typedef pair<int,int> pii;
const int INF = 9e18;
const int inf = 2e9;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
int qmi(int a,int k)
{
    int res = 1;
    while(k)
    {
        if(k & 1) res = res * a % mod;
        k >>= 1;
        a = a * a % mod;
    }
    return res;
}
int MOD(int x)
{
    return (x % mod + mod) % mod;
}
int inv(int x)
{
    return qmi(x,mod-2);
}

signed main()
{
    // ios::sync_with_stdio(0);
    // cin.tie(0);
    int n ,k ;
    cin >> n >> k;

    cout << 1 << ' ' << 1 << endl;
    map<int,map<int,int>> vis;
    int x = n;
    vis[1][1] = 1;
    for(int i = 1;i < n;i ++)
    {
        cout << i << ' ' << x << endl;
        cout << i + 1 << ' ' << x << endl;
        vis[i][x] = 1;
        vis[i+1][x] = 1;
        x --;
    }
    cout << n << ' ' << 1 << endl;
    vis[n][1] = 1;
    x = 2 * n + 1;
    for(int i = 1;i <= n && x <= k;i ++)
    {
        for(int j = 1;j <= n && x <= k;j ++)
        {
            if(!vis[i][j])
            {
                cout << i << ' ' << j << endl;
                x ++;
            }
        }
    }
}