#include <bits/stdc++.h>
#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
    #include <filesystem>
    namespace fs = std::filesystem;
#else
    #define DBG(X)
    #define SAY(X)
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 1,-1, 1,-1};
int dy[]={0, 1, 0, -1, 1, 1,-1,-1};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
static mt19937 _g(time(nullptr));
 
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const map<T, S> p) { for (auto el : p) cout << "[" << el.first << ";" << el.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

int N,M;
void input(){
    fast_io();
    #ifdef __LOCAL
        fs::path __p = __FILE__;
        fs::path __input, __output;
        __input = __output = __p.parent_path();
        __input += string("/input/") + string(__p.stem()) + string(".txt");
        __output += string("/output/") + string(__p.stem()) + string(".txt");
        freopen(__input.c_str(), "r", stdin);
        freopen(__output.c_str(), "w", stdout);
    #endif
    cin >> N >> M;
}

int odd_solve(){
    vector<pii> ans;
    for (int i = 0; i < M; i++)
    {
        ans.emplace_back(i+1,N-i);
    }
    for(pii a:ans){
        printf("%d %d\n",a.first,a.second);
    }
    return 0;
}

int even_solve(){
    vector<pii> ans;
    for (int i = 0; i < M; i++)
    {
        if(N-i-i-1<=N/2) ans.emplace_back(i+1,N-i-1);
        else ans.emplace_back(i+1,N-i);
    }
    for(pii a:ans){
        printf("%d %d\n",a.first,a.second);
    }
    return 0;
}

int wrong_even_solve(){
    vector<int> vec;
    vec.push_back(0);
    vec.push_back(1);
    int d=1;
    vector<bool> used(N,false);
    vector<bool> used_D(N,false);
    used[0] = used[1] = true;
    used_D[0] = true;
    used_D[1] = true;
    if(N%2==0) used_D[N/2] = true;
    for (int i = 0; i < (M-1); i++)
    {
        d=1;
        while(used_D[d%N]) d++;
        int next = 0;
        while(used[next]) {next++; next%=N;}
        used[next] = true;
        int pair = (next+d)%N;
        while(used[pair] || used_D[d%N]){d++;pair=(next+d)%N;}
        used[pair] = true;
        used_D[d%N] = true;
        vec.push_back(next);
        vec.push_back(pair);
    }
    // for (int i = 0; i < N; i++)
    // {
    //     if(!used[i]) vec.push_back(i);
    // }
    for (int i = 0; i < M; i++)
    {
        printf("%d %d\n",vec[2*i]+1,vec[2*i+1]+1);
    }
    return 0;
}

void next_vec(vector<int> &v){
    int n=v.size();
    for (int i = 0; i < n; i++)
    {
        v[i]++;
        v[i]%=n;
    }
}

bool isok(vector<int> v, int m=1){
    int n=v.size();
    m = (n-1)/2;
    bool used[n+10][n+10];
    memset(used,false,sizeof(used));
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if(used[v[2*j]][v[2*j+1]]) return false;
            if(used[v[2*j+1]][v[2*j]]) return false;
            used[v[2*j]][v[2*j+1]]=true;
            used[v[2*j+1]][v[2*j]]=true;
        }
        next_vec(v);
    }
    return true;    
}

int test(){
    vector<int> vec;
    int n=12;
    for (int i = 0; i < n; i++) vec.push_back(i);
    do
    {
        if(isok(vec)) {
            DBG(vec);
            for (int i = 0; i < n; i++)
            {
                next_vec(vec);
                DBG(vec)
            }
            
            break;
            }
    } while (next_permutation(vec.begin(),vec.end()));
    return 0;
}

int main()
{
    input();
    if(N%2) odd_solve();
    else even_solve();
    // even_solve();
    // test();
    return 0;
}


Measured memory_bytes: 4220