#include <bits/stdc++.h>
using namespace std;
const int B = 1e3 + 5;
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
int m = n + k;
vector < int > a(m + 1);
map < int , bool > is;
for(int i = 1; i <= m; i++){
cin >> a[i];
is[a[i]] = true;
}
set < int > st;
map < int, vector < int > > mp;
for(int i = 1; i <= m; i++){
for(int j = i + 1; j <= m; j++){
vector < int > &cur = mp[a[i] + a[j]];
cur.push_back(a[i]);
cur.push_back(a[j]);
st.insert(a[i] + a[j]);
}
}
int mx = 0, sum = -1;
for(auto x : st){
if(mp[x].size() > mx){
mx = mp[x].size();
sum = x;
}
}
deque < int > rs;
for(int i = 1; i <= m; i++){
if(is[sum - a[i]] == true){
rs.push_back(a[i]);
}
}
if(rs.size() > n){
rs.pop_front();
rs.pop_back();
}
sort(rs.begin(), rs.end());
for(auto i : rs)
cout << i << ' ';
cout << endl;
}
