#include <bits/stdc++.h>
using namespace std;
int n, k, h, cnt, tmp[100010], ans[100010];
long double eps;
struct lemming {
  int v, w, id;
  bool operator<(const lemming &tmp) const {
    return w < tmp.w || (w == tmp.w && v < tmp.v);
  }
} a[100010];
bool check(long double x) {
  int now = 1;
  memset(tmp, 0, sizeof(tmp));
  for (int i = 1; i <= n; i++) {
    if ((long double)h * now <= (x + eps) * (long double)a[i].v) {
      tmp[now++] = a[i].id;
    }
  }
  return now > k;
}
int main() {
  cin >> n >> k >> h;
  eps = (n >= 1000 ? 1e-15 : 1e-18);
  for (int i = 1; i <= n; i++) a[i].id = i;
  for (int i = 1; i <= n; i++) cin >> a[i].w;
  for (int i = 1; i <= n; i++) cin >> a[i].v;
  sort(a + 1, a + n + 1);
  long double l = 0, r = k * h;
  while (l <= r - eps && cnt++ <= 1000) {
    long double mid = (l + r) / 2;
    if (check(mid)) {
      memcpy(ans, tmp, sizeof(ans));
      r = mid;
    } else {
      l = mid;
    }
  }
  for (int i = 1; i <= k; i++) cout << ans[i] << " ";
  return 0;
}
