#include <bits/stdc++.h>
using namespace std;
int ans[300000], anssize;
int a[300000], cnt[10000000];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
for (int i = 0; i < n + k; i++) {
cin >> a[i];
cnt[a[i] % 9999889] = 1;
}
sort(a, a + n + k);
function<void(int)> check = [&](int sum) {
anssize = 0;
for (int i = 0; i < n + k; i++) {
if (anssize == n) break;
if (sum - a[i] <= a[i]) break;
if (cnt[(sum - a[i]) % 9999889] == 1) {
ans[anssize++] = a[i];
ans[anssize++] = sum - a[i];
}
}
if (anssize < n) return;
sort(ans, ans + anssize);
int l = 0, r = anssize - 1;
while (l <= r) {
cout << ans[l++] << ' ';
}
exit(0);
};
if (k <= 20) {
for (int i = 0; i <= k; i++) {
for (int j = max(i + 1, n - 1); j < n + k; j++) {
check(a[i] + a[j]);
}
}
}
map<int, int> cntsum;
int mx = -1, sum = -1;
for (int i = 0; i < n + k; i++) {
for (int j = i + 1; j < n + k; j++) {
cntsum[a[i] + a[j]]++;
if (cntsum[a[i] + a[j]] > mx)
mx = cntsum[a[i] + a[j]], sum = a[i] + a[j];
}
}
check(sum);
return 0;
}
