#include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
int main() {
int n, k; cin >> n >> k;
vector<ll> ar(n+k+1), val;
map<ll, bool> frek;
for (int i = 1; i <= n+k; i++){
cin >> ar[i];
frek[ar[i]] = 1;
}
sort(ar.begin()+1, ar.end());
for (int i = 1; i <= k+1; i++){
int en = n-i+1, st = max(i+1,en-k);
for (int j = st; j <= en; j++){
ll cur = ar[i]+ar[j];
val.pb(cur);
}
}
ll sum = 0;
for (ll x : val){
int cnt = 0;
for (int i = 1; i <= n+k; i++){
ll rem = x-ar[i];
if (frek.count(rem)) cnt++;
}
if (cnt >= n){
sum = x;
break;
}
}
set<ll> ele;
for (int i = 1; i <= n+k; i++){
ll rem = sum-ar[i];
if (frek.count(rem)) ele.insert(ar[i]);
}
for (int i = 1; i <= n; i++){
ll cur = *ele.begin();
cout << cur << " ";
ele.erase(ele.begin());
}
cout << "\n";
}
