#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 200007;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int n, k, a[M];
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> k;
for(int i = 1; i <= n + k; ++i) cin >> a[i];
sort(a + 1, a + n + 1);
for(int i = 1; i <= n + k; ++i){
vector <int> v;
for(int j = 1; j <= n + k; ++j) if(j != i) v.pb(a[j]);
int sum = v[0] + v.back(), wr = 0;
for(int j = 0; j < n / 2; ++j) if(v[j] + v[n - j - 1] != sum) wr = 1;
if(!wr){
for(int j = 1; j <= n + k; ++j) if(j != i) cout << a[j] << " ";
cout << endl;
break;
}
}
return 0;
}
// Don't forget special cases. (n = 1?)
// Look for the constraints. (Runtime array? overflow?)
