#include <iostream>

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

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

int a[100005];
int maxn = -100001, minn = 100001;  // 初始化极值[3](@ref)[4](@ref)

// 读入并同时找最大值最小值
for (int i = 0; i < n; i++) {
    cin >> a[i];
    maxn = max(maxn, a[i]);
    minn = min(minn, a[i]);
}

// 替换并输出
for (int i = 0; i < n; i++) {
    if (a[i] > k) {
        a[i] = maxn;           // 大于k替换为最大值[7](@ref)[8](@ref)
    } else if (a[i] < k) {
        a[i] = minn;           // 小于k替换为最小值[7](@ref)[8](@ref)
    }
    // 等于k保持不变
    cout << a[i] << " ";
}
return 0;

}