#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;


//map


int main()
{
	int n, m, k;
	cin >> n >> m >> k;
	int arr[5];
	for (int i = 0; i < n; i++)
	{
		cin >> arr[i];
	}
	sort(arr, arr + n);
	int ch = 0;
	for (int  i = n; i > n - k; i--)
		{
			cout << i<<" ";
			ch++;
		}
	if (ch < m)
	{
		for (int i = 0; i < m - ch; i++)
		{
			cout << n<<" ";
		}
	}



}