#include <iostream>
#include <algorithm>
using namespace std;
void sort(int a[], int l, int r)
{
for (int i = l; i <= r; i ++ )
{
int k = i;
for (int j = i + 1; j <= r; j ++ )
if (a[k] > a[j]) k = j;
if (k != i) swap(a[k], a[i]);
}
}
int main()
{
int a[1010];
int n, l, r;
cin >> n >> l >> r;
for (int i = 0; i < n; i ++ ) cin >> a[i];
sort(a, l, r);
for (int i = 0; i < n; i ++ ) cout << a[i] << ' ';
return 0;
}