#include <bits/stdc++.h>
//#include "grader.h"
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/
#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
//#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
//#define sort(a) sort(a.begin(), a.end())
#define all(a) a.begin(), a.end()
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 5000000000000000000
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(1488);
ll randll(ll l, ll r){
return uniform_int_distribution<ll>(l, r)(rng);
}
int main() {
speed;
srand(time(0));
ll n, k;
cin >> n >> k;
vll a(n+k);
for (int i = 0; i < n+k; i ++) {
cin >> a[i];
}
if (n == k) {
return 0;
}
sort(all(a));
for (int i = 0; i < k+1; i ++) {
for (int j = n+k-1; j >= n-1; j --) {
if (i == j) break;
map<ll, vll> m;
for (int i1 = 0; i1 < n+k; i1 ++) {
m[a[i1]].pb(i1);
}
vll b;
vbool us(n+k, 0);
ll s = a[i]+a[j];
for (int i1 = 0; i1 < n+k; i1 ++) {
if (us[i1]) continue;
us[i1] = 1;
if (m.find(s-a[i1]) != m.end()) {
ll c = m[s-a[i1]].back();
while (us[c]) {
m[s-a[i1]].pop_back();
if (m[s-a[i1]].empty()) {
c = -1;
break;
}
c = m[s-a[i1]].back();
}
if (c == -1) continue;
b.pb(i1);
b.pb(c);
us[c] = 1;
m[s-a[i1]].pop_back();
if (m[s-a[i1]].empty()) m.erase(s-a[i1]);
if (b.size() == n) break;
}
}
if (b.size() == n) {
sort(all(b));
for (int i1 : b) {
cout << i1+1 << ' ';
}
cout << endl;
return 0;
}
}
}
}
