#include <bits/stdc++.h>
using namespace std;

int N;
int K;

int main(){
    scanf(" %d",&N);
    scanf(" %d",&K);

    int num = (N-1)/2;
    long long int sum = 0;

    vector<int> v;
    vector<int> ans;

    for(int i = 1; i <= K; i++){
        v.push_back(i);
        sum += i;
    }

    sum %= N;

    if(sum == 0){
        ans.push_back(v.back() + 1);
        v.pop_back();
        while(!v.empty()){
            ans.push_back(v.back());
            v.pop_back();
        }
    }
    else if(sum == 1){
        while(!v.empty()){
            ans.push_back(v.back());
            v.pop_back();
        }
    }
    else{
        int fum = N + 1 - sum;

        for(int i = K; i >= 1; i--,num--){
            if(fum <= num - i){
                v.pop_back();
                ans.push_back(fum + i);
            }
            else{
                fum -= (num - i);
                ans.push_back(num);
                v.pop_back();
            }
        }

        while(!v.empty()){
            ans.push_back(v.back());
            v.pop_back();
        }
    }

    int p = 1;

    for(int i = 1; i < N; i++){
        for(int j = 0; j < K; j++){
            p = (p + ans[j] - 1) % N + 1;
            printf("%d ",p);
        }
    }

}