#include "bits/stdc++.h"
using namespace std;
#define int long long
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ss second
#define ff first
#define pb push_back
mt19937 rng(123);
void solve(){
int n, k; cin >> n >> k;
int N = n + k;
map<int, int> mp;
vector<int> v(N);
for(int i = 0; i < N; i++){
cin >> v[i];
mp[v[i]]++;
}
vector<int> ans;
auto get = [&](int m) -> bool {
int a = 0, b = 0;
for(int i = 0; i < N; i++){
int x = m - v[i];
if(mp[x] == 1 && x > v[i]){
ans.pb(v[i]);
ans.pb(x);
}
if(ans.size() == n) break;
}
return ans.size() == n;
};
while(true){
int i = rng() % (n + k);
int j = rng() % (n + k);
int m = v[i] + v[j];
if(get(m)) break;
}
sort(all(ans));
for(int &i : ans) cout << i << ' ';
}
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);
int t = 1; //cin >> t;
while(t--){
solve();
cout << endl;
}
return 0;
}
