#include <bits/stdc++.h>
const long long inf = LLONG_MAX;
const double eps = 1e-4;
const long long mod = 1000000007;
const double PI = acos(-1);
const long long N = 1e3 + 5;
const long long M = 1e3 + 5;
using namespace std;
long long k;
long double h;
vector<long long> m, v;
vector<long long> order;
vector<long long> order1;
bool comp(long long a, long long b) {
  if (m[a] < m[b])
    return 1;
  else if (m[a] == m[b])
    return v[a] < v[b];
  else
    return 0;
}
bool valid(long double t, vector<long long> &a) {
  long long cnt = 0;
  for (long long i = 0; i < a.size(); i++) {
    if (cnt == k) break;
    if (((cnt + 1) * h) / v[a[i]] <= t) {
      order1[cnt] = a[i];
      cnt++;
    }
  }
  if (cnt == k) {
    for (long long i = 0; i < k; i++) order[i] = order1[i];
    return 1;
  } else
    return 0;
}
long double binS(vector<long long> &a) {
  long double s = 0, e = k * h;
  long double ans = -1;
  long long iters = 0;
  while (iters < 100) {
    ++iters;
    long double mid = (s + e) / 2;
    if (valid(mid, a)) {
      ans = mid;
      e = mid;
    } else
      s = mid;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long tc;
  tc = 1;
  while (tc--) {
    long long n;
    cin >> n >> k >> h;
    m.resize(n + 1);
    v.resize(n + 1);
    vector<long long> a(n);
    for (long long i = 0; i < n; i++) {
      a[i] = i + 1;
      cin >> m[a[i]];
    }
    for (long long i = 0; i < n; i++) cin >> v[a[i]];
    sort(a.begin(), a.end(), comp);
    order.resize(k);
    order1.resize(k);
    long double ans = binS(a);
    for (long long i = 0; i < order.size(); i++) cout << order[i] << " ";
  }
}
