#include <bits/stdc++.h>
using namespace std;
struct node {
  long long w, v, i;
  bool operator<(const node &A) const {
    if (w == A.w) return v > A.v;
    return w > A.w;
  }
} d[100005];
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
  return x * f;
}
long long n, k, h, ans[100005], tmp[100005], anst = 1e9;
bool check(long double t) {
  memset(tmp, 0, sizeof(tmp));
  long long now = k;
  for (long long i = 1; i <= n; ++i) {
    if (!now) break;
    if ((long double)now * (long double)h <= (long double)d[i].v * t)
      tmp[now--] = d[i].i;
  }
  if (now == 0) return 1;
  return 0;
}
signed main() {
  n = read(), k = read(), h = read();
  for (long long i = 1; i <= n; ++i) d[i].w = read();
  for (long long i = 1; i <= n; ++i) d[i].v = read();
  for (long long i = 1; i <= n; ++i) d[i].i = i;
  sort(d + 1, d + n + 1);
  long double l = 0, r = k * h;
  for (long long cnt = 1; cnt <= 300; ++cnt) {
    long double mid = (l + r) / 2.0;
    if (check(mid))
      r = mid, memcpy(ans, tmp, sizeof(ans));
    else
      l = mid;
  }
  for (long long i = 1; i <= k; ++i) {
    printf("%lld ", ans[i]);
  }
  return 0;
}
