#include <bits/stdc++.h>
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e9+7;
const int inf = 1e18;
int bp(int x, int y, int p){
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int MI(int n, int p){
return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
return x * 1ull * y % p;
}
int di(int x,int y, int p){
return mul(x, MI(y, p), p);
}
int n , m , k , q;
void solve(int testcase_number){
cin>>n>>k;
input(int,a,n+k);
sort(all(a));
int ta =0 ;
int tb =0 ;
int l =0 ;
int r = n-1;
// print(a);
while(r<n+k){
int tl = l;
int tr = r;
int ta = 0;
int tb = 0;
while(tl < tr){
if(tl%2 == l%2){
ta+=a[tl];
ta+=a[tr];
tl++;
tr--;
}
else{
tb+=a[tl];
tb+=a[tr];
tl++;
tr--;
}
}
// cout<<ta<<" "<<tb<<endl;
if(ta == tb){
for(int i = l;i<=r;i++){
cout<<a[i]<<" ";
}
cout<<endl;
return;
}
l++;
r++;
}
}
signed main(){
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);
cout << fixed<<setprecision(9);
int t = 1;
// cin>>t;
for(int i = 1;i<=t;i++){
solve(i);
}
}
