/*
██████╗ █████╗ ███████╗██╗ ██╗██╗██████╗
██╔══██╗██╔══██╗██╔════╝██║ ██║██║██╔══██╗
██████╔╝███████║███████╗███████║██║██║ ██║
██╔══██╗██╔══██║╚════██║██╔══██║██║██║ ██║
██║ ██║██║ ██║███████║██║ ██║██║██████╔╝
╚═╝ ╚═╝╚═╝ ╚═╝╚══════╝╚═╝ ╚═╝╚═╝╚═════╝
*/
#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;
}
if(k==1){
ll sum = v[1]+v[n+k-1];
ll son = n+k-2;
bool ok = true;
for(ll i = 2;i<n+k;i++){
ll tt = v[i] + v[son];
if(tt!=son){
ok = false;
break;
}
son--;
}
if(ok){
for(ll i = 1;i<n+k;i++){
cout<<v[i]<<" ";
}
return;
}
bool flag = true;
ll cem = v[0]+v[n+k-2];
ll son1 = n+k-3;
for(int i = 1;i<n+k-1;i++){
ll xy = v[i]+v[son1];
if(xy!=cem){
flag=false;
break;
}
son1--;
}
if(flag){
for(int i = 0;i<n+k-1;i++){
cout<<v[i]<<" ";
}
return;
}
}
for(ll i = 0;i<=k;i++){
ll son = i + n - 1;
ll sum = v[i]+v[son];
bool ok = true;
for(ll j = 0;j<n/2;j++){
if(v[i+j] + v[son-j]!=sum){
ok = false;
break;
}
}
if(ok){
for(ll j = i;j<=son;j++){
cout<<v[j]<<" ";
}
return;
}
}
}
signed main(){
ll t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
