#include<bits/stdc++.h>

using namespace std;

queue q;

int n,m;

int main(){

cin>>n>>m;
for(int i=1;i<=n;i++){
	q.push(i);
}
int cnt=1;
while(!q.empty()){
	
	if(cnt!=m){
		q.push(q.front());
		q.pop();
		cnt++;
	}
	if(cnt==m){
		cout<<q.front()<<" ";
		q.pop();
		cnt=1;
	}
	
}
return 0;

} /**/

#include<bits/stdc++.h>

using namespace std;

queue q;

int main(){

int n,m;
cin>>n>>m;
int a[1000];
for(int i=1;i<=n;i++){
	q.push(i);
}
int cnt=1;
while(!q.empty()){
	if(cnt!=m){
	q.push(q.front());
	q.pop();
	cnt++; 
	}
	else{
		cnt=1;
		cout<<q.front()<<" ";
		q.pop();
	}
}

return 0; 

}