// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define pii pair<int,int>
const int mod=998244353;
const int maxn=150005;
const int maxa=1000005;
int power(int a,int n){
int res=1;
while(n){
if(n&1) res=res*a%mod;
a=a*a%mod;n>>=1;
}
return res;
}
map<int,int> mp,num;
int n,k,a[maxn];
void cal(int x){
vector<int> ans;
for(int i=1;i<=n;i++){
if(x<a[i]) break;
if(num[x-a[i]]<i || num[x-a[i]]==0) continue;
ans.push_back(i);ans.push_back(num[x-a[i]]);
if((int)ans.size()==n) break;
}
sort(ans.begin(),ans.end());
for(int v:ans) cout << v << ' ';
}
void solve(){
cin >> n >> k;
for(int i=1;i<=n+k;i++){cin >> a[i];num[a[i]]=i;}
for(int i=1;i<=n+k;i++){
for(int j=max(i+1,(n-i));j<=min(n,n-i+2*k);j++) mp[a[i]+a[j]]++;
}
for(auto x:mp){
if(x.second>=n/2){
cal(x.first);
return;
}
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int t=1;//cin >> t;
while(t--) solve();
}
