// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n"
#define fi first
#define se second
const int M=1e9+7;
const int inf = 1e14;
const int LOG=17;
const int N=1e5+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
void solve(){
cin >> n >> k;
vector<int>a(n+k);
for (int i=0;i<n+k;i++){
cin >> a[i];
}
sort(a.begin(),a.end());
set<int>df;
map<int,int>cn;
for (int i=0;i<k+1;i++){
for (int j=n+k-1;j>=max(0ll,n-1-i);j--){
if (j==i)break;
df.insert(a[i]+a[j]);
cn[a[i]+a[j]]++;
}
}
for (int i=k+1;i<n+k;i++){
for (int j=n+k-1-(i-k);j>=max(0ll,n-1-i);j--){
if (j==i)break;
df.insert(a[i]+a[j]);
cn[a[i]+a[j]]++;
}
}
for (int x:df){
if (cn[x]!=n)continue;
c=0;
map<int,int>d;
for (int i=0;i<n+k;i++){
if (d[x-a[i]]){
c+=2;
d[x-a[i]]--;
}
else{
d[a[i]]++;
}
}
if (c>=n){
c=0;
vector<int>b;
for (int i=0;i<n+k;i++){
if (d[x-a[i]]){
c+=2;
b.push_back(x-a[i]);
b.push_back(a[i]);
d[x-a[i]]--;
}
else{
d[a[i]]++;
}
if (c==n)break;
}
sort(b.begin(),b.end());
for (int i:b){
cout << i << " ";
}
cout << endl;
break;
}
}
}
signed main()
{
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r" ,stdin);
// freopen("output.txt","w",stdout);
// #endif
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
cout << fixed << setprecision(9);
srand(time(0));
// int t=1;
// cin >> t;
for (int _=1;_<=t;_++){
solve();
q++;
}
}
