//*** 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], say[maxn];
void _(ll &tt){
cin >> n >> m;
for(ll i = 1; i <= n + m; i ++){
cin >> a[i];
}
sort(a + 1, a + n + 1);
// ind == 1:
ll l = 2, r = n + m, f = 1;
while(l < r){
if(a[l] + a[r] != a[2] + a[n + m]){
f = 0;
break;
}
l ++, r --;
}
if(f){
for(ll i = 2; i <= n + m; i ++) cout << a[i] << ' ';
return;
}
// ind == n + m:
l = 1, r = n + m - 1, f = 1;
while(l < r){
if(a[l] + a[r] != a[1] + a[n + m - 1]){
f = 0;
break;
}
l ++, r --;
}
if(f){
for(ll i = 1; i <= n + m - 1; i ++) cout << a[i] << ' ';
return;
}
pll p = {-1, -1};
l = 1, r = n + m;
while(l < r){
if(a[l] + a[r] != a[1] + a[n + m]){
p = {l, r};
break;
}
l ++, r --;
}
if(p.fr == -1){
for(ll i = 1; i <= n + m; i ++) if(i != l) cout << a[i] << ' ';
return;
}
// l
l = 1, r = n + m, f = 1;
while(l < r){
if(l == p.fr){
l ++;
continue;
}
if(a[l] + a[r] != a[1] + a[n + m]){
f = 0;
break;
}
l ++, r --;
}
if(f){
for(ll i = 1; i <= n + m; i ++) if(p.fr != i) cout << a[i] << ' ';
}
else{
for(ll i = 1; i <= n + m; i ++) if(p.sc != i) cout << a[i] << ' ';
}
}
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";
}
