是那道题就不用知道了

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<list>
using namespace std;

list<int> l;
int ans[100000];
 
int main(){
	int n, k, p, cur = 0;
	cin >> n >> k >> p;
	for (int i = 1; i<= k; i++) l.push_back(i);
	for (int i = 1; i <= k - k / n; i++)
	{
		for (int j = 1; j < n; j++)
		{
			l.pop_front();
			for (int _ = 1; _ <= p; _++)
			{
				l.push_back(l.front());
				l.pop_front();
			}
		}
		cur++;
		ans[cur] = l.front();
		l.pop_front();
		for (int _ = 1; _ <= p; _++)
		{
			l.push_back(l.front());
			l.pop_front();
		}
	}
	sort(ans+1, ans + cur + 1);
	for (int i = 1; i <= cur; i++)
	{
		cout << ans[i] << " \n";
	}
	return 0;
}