#include <bits/stdc++.h>
using namespace std;

int n, m;
struct Node{
	int data;
	Node *prev, *next;
};
int main() {
	cin >> n >> m;
	Node *head = new Node;
	head->data = 1;
	head->next = head->prev = NULL;
	Node *now = head;
	for (int i = 2; i <= n; i++) {
		Node *p = new Node;
		p->data = i;
		p->next = NULL; 
		now->next = p;
		p->prev = now;
		now = p;
	}
	head->prev = now;
	now->next = head;
	
	now = head;
	while((n--)>1) {
		for (int i = 1; i < m; i++) {
			now = now->next;
		}
		printf("%d ", now->data);
		now->prev->next = now->next;
		now = now->next;
	}
	printf("%d", now->data);
	return 0;
}

0分