#include <bits/stdc++.h>
using namespace std;
const int N = 3e5+5;
int a[N];
int n, k;
map<array<int, 2>, bool> seen;
vector<int> build(int l, int r, int sm){
vector<int> ans;
while(l < r){
seen[{l, r}] = true;
if(a[l] + a[r] > sm) {
r--;
}
else if(a[l]+a[r] < sm) {
l++;
}
else {
if(ans.size()*2 >= n) break;
ans.push_back(a[l++]);
r--;
}
}
if(ans.size()*2 < n) return {};
while(ans.size()*2 > n) ans.pop_back();
int sz = ans.size();
for(int i=sz-1; i>=0; i--) ans.push_back(sm-ans[i]);
return ans;
}
// for(int i=1; i<=n; i++)
void solve(){
cin >> n >> k;
for(int i=1; i<=n+k; i++) cin >> a[i];
for(int r=n+k; r>=n-2; r--){
for(int l=1; l<=2+k; l++){
if(l >= r) break;
if(r-l+1 < n) continue;
if(seen[{l, r}]) continue;
int sm = a[l] + a[r];
//
vector<int> ans = build(l, r, sm);
if(ans.size()) {
for(int i: ans) cout << i << " ";
return;
}
//
}
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
}
