#include <iostream>
using namespace std;
int n,k,mk[155];
int nxt(int x){
    x=(x==n?1:x+1);
    while(mk[x]){
        x=(x==n?1:x+1);
    } 
    return x;
}
int main(){
    freopen("ysf.in","r",stdin);
    freopen("ysf.out","w",stdout);
    cin>>n>>k;
    int p=1;
    for(int i=1;i<=n;i++){
        for(int j=1;j<k;j++)p=nxt(p);
        cout<<p<<endl;
        if(i==n)break;
        mk[p]=1;
        p=nxt(p);
    }
    return 0;
}