// #ifdef __AVX2__
// #pragma GCC target "avx2"
// #endif
// #pragma GCC optimize "O3"
// #pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector
// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e5+5;
int cnt(int su,vec<int>&a){
map<int,int>d;
int ans=0;
for(auto i:a){
if(d[su-i]>0){
d[su-i]--;
ans++;
}
else d[i]++;
}
return ans;
}
int iter=1,itera=1;
void solve(){
int n,k;
cin>>n>>k;
vec<int>a(n+k);
inp(a);
// reverse(all(a));
for(int i=0;i<=k;i++){
for(int j=n+k-1;(n+k)-j<=k+1;j--){
// cout<<a[i]+a[j]<<endl;
if(cnt(a[i]+a[j],a)>=n/2){
vec<int>ans;
int su=a[i]+a[j];
map<int,int>d;
for(auto i:a){
if(d[su-i]>0){
ans.append(i);
ans.append(su-i);
d[su-i]--;
if(ans.size()==n) break;
}
else d[i]++;
}
sort(all(ans));
print(ans)
return;
}
}
}
}
signed main(){
// freopen("","r",stdin);
// freopen("","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<fixed<<setprecision(20);
// cin>>itera;
for(iter=1;iter<=itera;iter++) solve();
}
