#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <map>
#include <set>
#include <numeric>
#include <cmath>

using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()


int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n, k;
    cin >> n >> k;

    set<pair<int, int>> s;
    for(int i = 1; i <= n - 1; ++i){
        cout << i << " " << i << "\n";
        cout << i << " " << i + 1 << "\n";
        s.insert({i, i});
        s.insert({i, i + 1});
    }
    cout << n << " " << n << "\n";
    cout << n << " " << 1 << "\n";
    s.insert({n, n});
    s.insert({n, 1});

    int x = 1, y = 1;
    for(int i = 2 * n + 1; i <= k; ++i){
        while(s.count({x, y})){
            if(y == n){
                ++x;
                y = 1;
            }
            else{
                ++y;
            }
        }

        cout << x << " " << y << "\n";
        s.insert({x, y});
    }
}