#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int inf = 0x3f3f3f3f;
long long n, k, h;
struct node {
  long long pos;
  long long w, v;
} a[maxn];
bool cmp(struct node& a, struct node& b) {
  if (a.w != b.w) return a.w < b.w;
  return a.v < b.v;
}
long long b[maxn];
long long res[maxn];
int main() {
  scanf("%lld %lld %lld", &n, &k, &h);
  for (int i = 1; i <= n; ++i) {
    scanf("%lld", &a[i].w);
    a[i].pos = i;
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%lld", &a[i].v);
  }
  sort(a + 1, a + 1 + n, cmp);
  double r = 1e9, l = 0;
  for (int j = 1; j <= 110; ++j) {
    double mid = (l + r) / 2.0;
    for (int i = 1; i <= n; ++i) b[i] = (long long)(mid * a[i].v / h * 1.0);
    long long temp = k;
    for (int i = n; i >= 1; --i) {
      if (b[i] >= temp) temp--;
    }
    if (temp <= 0) {
      r = mid;
    } else
      l = mid;
  }
  for (int i = 1; i <= n; ++i) b[i] = (long long)(r * a[i].v / h);
  long long temp = k;
  for (int i = n; i >= 1; --i) {
    if (b[i] >= temp) res[temp--] = a[i].pos;
    if (temp <= 0) break;
  }
  for (int i = 1; i <= k; ++i) {
    if (i != 1) printf(" ");
    printf("%lld", res[i]);
  }
}
