#include<bits/stdc++.h>
using namespace std;
int main(){
int                                  n,k,m,a[105],pre[105],next[105],p,q,o[105],kl=1;

cin>>n>>m;
int mmm=n;
for(int i=1;i<=n;i++){
a[i]=i;
next[i]=i+1;
pre[i]=i-1;
}
next[n]=1;
pre[1]=n;
p=1;
q=1;
while(n!=0){
k=m%n;
if(k==0) m=n;
 
while(q<m){
	p=next[p];
	q++;
}
o[kl]=a[p];
kl++;
next[pre[p]]=next[p];
pre[next[p]]=pre[p];
q=0;
n--;
}
for(int i=1;i<=mmm;i++)
cout<<o[i]<<" ";
	return 0;
}