#include <bits/stdc++.h>
using namespace std;
#define break_it assert(false)
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector <int> a(n+k);
function <int(vector <int>)> check=[](vector <int> s) {
int n = s.size();
for(int i = 0; i < n; i ++) {
int j = i + 1;
if(j >= n or n - i - 1 < 0 or n - j - 1 < 0) break;
if(s[i] + s[n-i-1] == s[j]+s[n-j-1]) continue;
return 0;
}
return 1;
};
function <void(int, int)> solve=[&](int start, int end) {
vector <int> fors;
int sum = a[start] + a[end];
int none = -1;
int l = 0, r = n+k-1;
while(l < r){
if(a[l] + a[r] > sum) {
if(none != -1) return;
none = r;
r--;
}else if(a[l] + a[r] < sum) {
if(none != -1) return;
none = l;
l ++;
}
l ++;
r --;
}
if(none == -1) {
none = (n+k)/2;
}
for(int i = 0; i <= n+k-1; i ++) {
if(none == i) continue;
fors.push_back(a[i]);
}
for(auto i : fors) cout << i << " ";
exit(0);
};
for(int i = 0; i < n+k; i ++) cin >> a[i];
solve(0, n+k-1);
solve(0, n+k-2);
solve(1, n+k-1);
break_it;
return false;
}
