//#pragma GCC optimize(2)
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>

#define INF 0x3f3f3f3f
#define lowbit(x) (x&(-x))
#define Mid (l+r)/2
#define Ls i<<1
#define Rs i<<1|1
#define Lson Ls,l,Mid
#define Rson Rs,Mid+1,r
#define For(i,a,b) for(int i=a;i<=b;i++)
#define FOr(i,a,b) for(int i=a;i>=b;i--)

using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
//tree<ll,null_type,std::less<ll>,splay_tree_tag,tree_order_statistics_node_update>sp;//红黑树是rb_tree_tag

/*
inline int read()
{
    int x = 0, f = 1; char c = getchar();
    while(c < '0' || c > '9') { if(c == '-') f = -f; c = getchar(); }
    while(c >= '0' && c <= '9') { x = x * 10 + c - '0'; c = getchar(); }
    return x * f;
}
*/
#define maxN 200010
#define M 1000000009
//parameter begin
ll n,k;
ll tmp,nowi,nowj,lasti,lastj,halfi,halfj;
//parameter end

//function begin

//function end
void solve()
{
    scanf("%d%d",&n,&k);
    tmp=0,nowi=1,nowj=1;
    For(i,1,2*n-1)
    {
        if(i%4==1) nowi=nowj=1+tmp;
        else if(i%4==2) nowi=1+tmp,nowj=n-tmp;
        else if(i%4==3) nowi=nowj=n-tmp;
        else if(i%4==0)
        {
            nowi=n-tmp;
            tmp++;
            nowj=1+tmp;
        }
        printf("%d %d\n",nowi,nowj);
    }
    lasti=nowi,lastj=1;
    printf("%d %d\n",lasti,lastj);
    if(k==2*n) return;
    tmp=2*n,halfi=n/2;
    if(n&1) halfj=n/2+1;
    else halfj=n/2;
    For(i,1,n)
        For(j,1,n)
        {
            if(i==j) continue;
            else if(i==lasti&&j==lastj) continue;
            else if( i<=halfi && j>halfj && i==n+1-j ) continue;
            else if( i>halfi && j<=halfj && i==n+1-j+1 ) continue;
            else
            {
                tmp++;
                printf("%d %d\n",i,j);
                if(tmp==k) return;
            }
        }
    return ;
}

int main ()
{
    ll T;
    T=1;
    while(T--) solve();
    return 0;
}