#include <bits/stdc++.h> using namespace std; inline void solve() { int n,k; cin>>n>>k; int a[n+k]; for (auto& i:a) cin>>i; map<int,vector<pair<int,int>>>sms; for (int i=0;i<n+k;i++) { int l=n+k,r=0; for (int j=0;j<=min(i,k);j++) { int ind=i+1-j; if (i+j-1>n/2) continue; int ex=(n-ind+1)-ind; l=min(l,ind+ex); r=max(r,ind+ex+k-j); } r=min(r,n+k); for (int j=l-1;j<r;j++) sms[a[i]+a[j]].push_back({a[i],a[j]}); } for (auto [i,j]:sms) { if (j.size()>=n/2) { vector<int>ind; for (auto [l,r]:j) { if (ind.size()==n) break; ind.push_back(l); ind.push_back(r); } sort(begin(ind),end(ind)); for (auto j:ind) cout<<j<<' '; cout<<endl;return; } } } int main() { ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); int t=1; for (int i=1;i<=t;i++) { solve(); } }