#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-13;
const int maxn = 100100;
int dblcmp(double x) {
  if (fabs(x) < eps) return 0;
  return x > 0 ? 1 : -1;
}
struct tt {
  int m, v, id;
} p[maxn];
int cmp(tt a, tt b) {
  if (a.m == b.m) return a.v > b.v;
  return a.m > b.m;
}
vector<int> ans;
int main() {
  int i, j, t, minv, now;
  int n, k, h;
  double ll, rr, mid;
  while (scanf("%d %d %d", &n, &k, &h) != EOF) {
    minv = 1000000000;
    for (i = 0; i < n; ++i) scanf("%d", &p[i].m);
    for (i = 0; i < n; ++i) {
      scanf("%d", &p[i].v);
      p[i].id = i + 1;
      minv = min(minv, p[i].v);
    }
    sort(p, p + n, cmp);
    ll = eps, rr = (double)k * h / minv;
    for (j = 0; j < 1000; ++j) {
      mid = (ll + rr) / 2.;
      now = k;
      for (i = 0; now && i < n; ++i) {
        if (dblcmp(p[i].v * mid - now * h) >= 0) now--;
      }
      if (!now)
        rr = mid;
      else
        ll = mid;
    }
    ans.clear();
    now = k;
    for (i = 0; now && i < n; ++i) {
      if (dblcmp(p[i].v * rr - now * h) >= 0) {
        ans.push_back(p[i].id);
        now--;
      }
    }
    for (i = ans.size() - 1; i >= 0; --i) {
      if (i != ans.size() - 1) printf(" ");
      printf("%d", ans[i]);
    }
    printf("\n");
  }
  return 0;
}
