#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

using namespace __gnu_pbds;
using namespace std;

tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> t;

main()
 {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,k;
    cin>>n>>k;
    for(int i=0;i<n;i++)
        t.insert(i+1);
    int cur=0;
    while(n)
    {
        cur=(cur+k-1)%n--;
        auto it=t.find_by_order(cur);
        cout<<*it<<"\n";
        t.erase(it);
    }
}