😊

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

queue<int>q;
int k, n, p;

int main(){
cin >> k >> n >> p;
for(int i = 1; i <= k; i ++ ) q.push(i);
while(q.size()){
cout << q.front() << " ";
q.pop();
for(int i = 0; q.size() && i < p; i ++ ){
int x = q.front();
q.pop();
q.push(x);
}
}
return 0;
}