#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma ("reroll")
#define skip continue;
#define gold ios_base::sync_with_stdio(false);cin.tie(NULL);
#define xa "\n"
#define int long long
#define all(a) a.begin(), a.end()
#define pb push_back
#define F first
#define S second
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e6 + 7;
const int MAX = 1e9;
const int inf = 1e18;
int gcd(int a, int b) { if (b == 0) return a; else if(a == 0) return b; else return gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
map < int, int > mp[N];
map < int, int > cnt;
void solve() {
int n, k;
cin >> n >> k;
int a[n + k + 1];
for(int i = 1; i <= n + k; i++){
cin >> a[i];
}
set < int > s;
for(int i = 1; i <= n + k; i++){
for(int j = 1; j <= n + k; j++){
if(i == j) skip;
mp[i][a[i] + a[j]]++;
cnt[a[i] + a[j]]++;
s.insert(a[i] + a[j]);
}
}
for(int x : s){
if(cnt[x] == n){
for(int i = 1; i <= n + k; i++){
if(mp[i][x] > 0){
cout << a[i] << ' ';
}
}
return;
}
}
}
signed main() {
gold;
//freopen("sum2.in", "r", stdin);
//freopen("sum2.out", "w", stdout);
int t = 1;
int ti = 1;
//cin >> t;
while (t--) {
//cout << "Case " << ti << ": ";
solve();
ti++;
}
}
