#include<bits/stdc++.h>
using namespace std;
int n,m,sum,x,i;
struct zqw {
	int next,last;
} a[105];
int main() {
	scanf("%d%d",&n,&m);
	a[1].next=2,a[i].last=n;
	for(int k=2; k<n; k++)
		a[k].next=k+1,a[k].last=k-1;
	a[n].next=1,a[n].last=n-1;
	i=1,x=1;
	while(sum!=n) {
		if(x==m) {
			printf("%d ",i);
			sum++,x=0;
			a[a[i].next].last=a[i].last;
			a[a[i].last].next=a[i].next;
			
		}
		i=a[i].next,x++;
	}

	return 0;
}

大佬，求救！！