#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define tm (tl+tr)/2
#define TL v+v, tl, tm
#define TR v+v+1, tm+1, tr
#define DA l <= tl && tr <= r
#define NE r < tl || tr < l
#define double long double
// #define int long long
using namespace std;
const int N=2e5+7;
const int mod=998244353;
const int inf=2e9;
int a[N];
int n, k;
map<int, bool>mp;
bool can(int l, int r){
if(l+1 > r)return 0;
int cnt=n/2;
int sum=a[l]+a[r];
if(mp[sum])return 0;
mp[sum]=1;
vector<int>v;
while(cnt && l < r){
if(sum == a[l]+a[r]){
v.pb(a[l]);
v.pb(a[r]);
cnt--;
l++;
r--;
}
else if(sum < a[l]+a[r])r--;
else if(a[l]+a[r] < sum)l++;
}
if(v.size()==n){
sort(all(v));
for(int i : v){
cout << i << ' ';
}
return 1;
}
return 0;
}
void solve(){
cin >> n >> k;
for(int i=1; i <= n+k; i++){
cin >> a[i];
}
for(int i=0; i <= k; i++){
for(int j=0; i+j <= k; j++){
if(can(1+i, n+k-j))return;
}
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int asd=1;
// cin >> asd;
while(asd--)
solve();
return 0;
}
