//*** Bismillah ***//
#pragma GCC optimize("O3", "fast-math", "unroll-loops", "no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
#define fr first
#define er erase
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define ull unsigned ll
#define vpll vector<pll>
#define len(x) (ll) x.size()
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll maxn = 2e5+5;
ll n,m,k=0;
ll a[maxn];
bitset<maxn>v;
void _(ll &tt){
cin >> n >> m;
for(ll i = 1; i <= n + m; i ++){
cin >> a[i];
}
sort(a + 1, a + n + 1);
auto ch = [&](ll cm){
ll l = 1, r = n + m, say = 0;
while(l < r){
if(v[l]){ l ++; continue; }
if(v[r]){ r --; continue; }
if(cm == a[l] + a[r]){ say ++; continue;}
else{
if(cm < a[l] + a[r]) l ++;
else r --;
continue;
}
l ++, r --;
}
if(say < n / 2) return 0;
for(ll i = 1; i <= n + m; i ++){
if(v[i]) continue;
cout << a[i] << ' ';
}
return 1;
};
if(ch(a[1] + a[n + m])) return;
if(ch(a[1] + a[n + m - 1])) return;
if(ch(a[2] + a[n + m])) return;
if(ch(a[2] + a[n + m - 1])) return;
}
signed main() {
ll tm = clock();
cin.tie(0)->sync_with_stdio(0);
ll t = 1;
// cin >> t;
for(ll tt = 1; tt <= t; tt ++) {
_(tt);
}
cerr << "\n\033[1;31mTime: \033[1;30m" \
<< (double)(clock()-tm)/1000000 << "\033[1;32m seconds\n";
}
