#include<bits/stdc++.h>
using namespace std;
map<pair<int,int>,int>a;
int main(){
    int n,k;
    cin>>n>>k;
    for(int i=1; i<=n*2-1; i++){
        if(i%2==1)a[make_pair((i+1)/2,(i+1)/2)]=i,cout<<(i+1)/2<<' '<<(i+1)/2<<endl;
        else a[make_pair(i/2,i/2+1)]=i,cout<<i/2<<' '<<i/2+1<<endl;
    }
    a[make_pair(n,n-1)]=n*2;
    cout<<n<<' '<<n-1<<endl;
    int x=1,y=1;
    for(int i=n*2+1; i<=k; i++){
        while(a.find(make_pair(x,y))!=a.end()){
            y++;
            if(y>n){
                x++;
                y=1;
            }
        }
        a[make_pair(x,y)]=i;
        cout<<x<<' '<<y<<endl;
    }

}