#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:255000000")
bool firstout = 1;
template <class T>
T &minn(T &a, T b) {
  if (b < a) a = b;
  return a;
}
template <class T>
T &maxx(T &a, T b) {
  if (a < b) a = b;
  return a;
}
int &madd(int &a, int b) {
  a += b;
  if (a >= 1000000009) a -= 1000000009;
  return a;
}
int &msub(int &a, int b) {
  a -= b;
  if (a < 0) a += 1000000009;
  return a;
}
int &mmult(int &a, int b) { return a = (long long)a * b % 1000000009; }
int mdiv(long long a, long long b, long long m) {
  a = (a % m + m) % m;
  b = (b % m + m) % m;
  if (a % b == 0) return a / b;
  return (a + m * mdiv(-a, m, b)) / b;
}
struct point {
  int m, v, i;
  bool operator<(const point &p) const {
    if (m != p.m) return m < p.m;
    if (v != p.v) return v < p.v;
    return 0;
  }
};
int n, m, h;
point A[101234];
int R[101234];
bool can(double t) {
  int i, j, k;
  for (i = 0, j = 0; i < n && j < m; ++i) {
    if ((j + 1.) * h / A[i].v <= t) R[j++] = A[i].i;
  }
  return j == m;
}
int main() {
  int i, j, k;
  char c;
  int a, d;
  int ts;
  for (ts = 1; scanf("%"
                     "d",
                     &(n)) > 0;
       ++ts) {
    scanf(
        "%"
        "d",
        &(m));
    scanf(
        "%"
        "d",
        &(h));
    for (i = (0); i < (n); ++i)
      scanf(
          "%"
          "d",
          &(A[i].m)),
          A[i].i = i;
    for (i = (0); i < (n); ++i)
      scanf(
          "%"
          "d",
          &(A[i].v));
    sort(A, A + n);
    double l = 0., r = 1012345678, mid;
    for (k = (0); k < (201); ++k) {
      mid = (l + r) / 2.;
      if (can(mid))
        r = mid;
      else
        l = mid;
    }
    can(r);
    for (i = (0); i < (m); ++i)
      printf((firstout) ? "%"
                          "d"
                        : " %"
                          "d",
             (R[i] + 1)),
          firstout = 0;
    printf("\n"), firstout = 1;
  }
  return 0;
}
