#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct El {
    int v;
    int d;
};

bool manji(El &a, El &b) {
    if(a.d == b.d) return a.v < b.v;
    else return a.d < b.d;
}

int main() {
    int n, k, x;
    cin >> n >> k >> x;

    vector<El> a(n);

    int input, distance;
    for(int i = 0; i < n; i++) {
        cin >> input;

        if(input < x) distance = x - input;
        else distance = input - x;

        a[i] = {input, distance};
    }

    sort(begin(a), end(a), manji);

    vector<int> niz_k(k);
    for(int i = 0; i < k; i++) {
        niz_k[i] = a[i].v;
    }

    sort(begin(niz_k), end(niz_k));
    for(int &el : niz_k) {
        cout << el << " ";
    }
    cout << endl;

}