#include <bits/stdc++.h>
using namespace std;
pair<pair<int, int>, int> p[100500];
int x[100500], y[100500];
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  double h;
  scanf("%lf", &h);
  for (int i = (0); i < (n); ++i) {
    scanf("%d", &p[i].first.first);
    p[i].second = i + 1;
  }
  for (int i = (0); i < (n); ++i) scanf("%d", &p[i].first.second);
  sort(p, p + n);
  for (int i = (0); i < (n); ++i)
    x[i] = p[i].first.first, y[i] = p[i].first.second;
  double lr = 0, rr = 1e9;
  for (int steps = (0); steps < (120); ++steps) {
    double mid = (lr + rr) / 2;
    int q = 0;
    for (int i = (0); i < (n); ++i)
      if ((q + 1) * h / y[i] <= mid) ++q;
    if (q < k)
      lr = mid;
    else
      rr = mid;
  }
  int q = 0;
  for (int i = 0; i < n && q < k; ++i)
    if ((q + 1) * h / y[i] <= rr) {
      printf(q ? " %d" : "%d", p[i].second);
      ++q;
    }
  puts("");
}
