#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T& container, string separator = " ", string finish = "\n"){
for(auto item: container) cout << item << separator;
cout << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
void solve(){
int n, k; cin >> n >> k;
n += k;
vector<int> a(n);
for(int i = 0; i < n; ++i) cin >> a[i];
map<int, int> mp;
for(int i = 0; i < min(n, k * 2); ++i)
for(int j = max(i + 1, n - k * 2); j < n; ++j){
mp[a[i] + a[j]]++;
}
vector<pair<int, int>> sigma;
for(pair<int, int> i: mp){
sigma.push_back(make_pair(i.second, i.first));
}
sort(ALL(sigma), greater<pair<int,int>>());
for(auto i: sigma){
int skipped = 0;
int sum = i.second;
int l = 0, r = n - 1;
while(l < r){
while(l < r && a[l] + a[r] != sum){
if (a[l] + a[r] < sum) l++;
else r--;
skipped++;
}
if (l >= r) break;
l++; r--;
}
if (skipped == k){
vector<int> ans;
int l = 0, r = n - 1;
while(l < r){
while(l < r && a[l] + a[r] != sum){
if (a[l] + a[r] < sum) l++;
else r--;
skipped++;
}
if (l >= r) break;
ans.push_back(a[l]); ans.push_back(a[r]);
l++; r--;
}
sort(ALL(ans));
printArr(ans);
return;
}
}
}
int main(void){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
clock_t start = clock();
solve();
cerr << "Time elapsed: " << clock() - start << "ms!\n";
return 0;
}
