#include<iostream>
#include<math.h>
#include<vector>
#include<unordered_map>
#include<algorithm>
#include<queue>
#include<string.h>
#define ll long long
using namespace std;


void solve()
{
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=2*n;i++)
    {
        if(i%2==0)
            cout<<i/2<<" "<<(i/2)%n+1<<endl;
        else
            cout<<i/2+1<<" "<<i/2+1<<endl;
    }
    int x=1,y=1;
    for(int i=2*n+1;i<=k;i++)
    {
        if(x==y) y+=2;
        if(y>n){
            y=1;
            x++;
            if(x==n) y=2;
        }
        cout<<x<<" "<<y<<endl;
        y++;
    }
}

int main()
{
    
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    int t;
    t=1;
    while(t>0)
    {
        t--;
        solve();
    }
    return 0;
    
}