//we are all lost trying to be someone.
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
#define sz(x) ll(x.size())
#define reve(x) reverse(x.begin(),x.end())
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
const ll MAX=3*(1e4+100);
const ll mod=1e9+7;
const ll inf=1e18+7;
ll A[MAX], s[30];
unordered_map<ll,ll> M,N;
vector<ll >c;
int main(){
ll n, k;
cin>>n>>k;
for(ll i=0; i<n+k; i++){
cin>>A[i];
M[A[i]]++;
}
sort(A,A+n+k);
ll cont=0;
for(ll i=0; i<k+1; i++){
for(ll j=n+k-1; j>=n-1; j--){
s[cont]=A[i]+A[j];
cont++;
}
}
bool xd=false;
for(ll i=0; i<cont; i++){
for(ll j=0; j<n+k and A[j]<s[i]/2; j++){
ll x=s[i]-A[j];
if(M.count(x)){
c.push_back(A[j]);
c.push_back(x);
if(sz(c)>=n){
xd=true;
break;
}
}
}
if(xd) break;
c.clear();
}
sort(c.begin(),c.end());
for(ll i=0; i<sz(c); i++){
cout<<c[i]<<" ";
}
cout<<'\n';
}
