/*
██████╗ █████╗ ███████╗██╗ ██╗██╗██████╗
██╔══██╗██╔══██╗██╔════╝██║ ██║██║██╔══██╗
██████╔╝███████║███████╗███████║██║██║ ██║
██╔══██╗██╔══██║╚════██║██╔══██║██║██║ ██║
██║ ██║██║ ██║███████║██║ ██║██║██████╔╝
╚═╝ ╚═╝╚═╝ ╚═╝╚══════╝╚═╝ ╚═╝╚═╝╚═════╝
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define ld long double
#define str string
#define ch char
#define db double
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define YES cout<<"YES\n";
#define NO cout<<"NO\n";
#define Bob cout<<"Bob\n";
#define Alice cout<<"Alice\n";
#define ordered_set tree<pair<ll, ll>, null_type,less<pair<ll,ll>>,rb_tree_tag,tree_order_statistics_node_update>
const ll MOD=1e9+7;
const ll INF = 10000000000;
void solve(){
ll n,k;
cin>>n>>k;
vector<ll>v(n+k);
for(int i = 0;i<n+k;i++){
cin>>v[i];
}
ll alma = v[0]+v[n+k-1];
ll armud = v[1]+v[n+k-2];
if(alma==armud){
for(int i = 0;i<n;i++){
cout<<v[i]<<" ";
}
return;
}
ll l = 0,r = n+k-1;
ll cnt=0;
while(l<=r){
ll kh = v[l]+v[r];
ll wg = v[l+1]+v[r-1];
if(kh>wg){
r--;
cnt++;
}
else if(kh<wg){
l++;
cnt++;
}
else{
if(cnt==k){
break;
}
}
}
for(int i = l;i<=r;i++){
cout<<v[i]<<" ";
}
}
signed main(){
ll t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
