#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; gp_hash_table<int, int>cnt; inline void solve() { int n,k; cin>>n>>k; int a[n+k]; map<int,int>pre; for (auto& i:a) cin>>i; for (int i=0;i<=k;i++) { for (int j=i+n-1;j<=i+n-1+k-i;j++) { int sm=a[i]+a[j]; int l=i+1,r=j-1; vector<int>ind; ind.push_back(a[i]); ind.push_back(a[j]); while (l<r&&ind.size()<n) { if (a[l]+a[r]==sm) { ind.push_back(a[l]); ind.push_back(a[r]); l++;r--; continue; } if (a[l]-a[i]<a[j]-a[r]) l++; else r--; } if (ind.size()==n) { sort(begin(ind),end(ind)); for (auto i:ind) cout<<i<<' '; 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(); } }