#include <bits/stdc++.h>
using namespace std;
long long n, k, h;
pair<long long, pair<long long, long long> > a[(101 * 1000)];
long long ans[(101 * 1000)], ans2[(101 * 1000)];
bool check(long double t) {
  long long p = 0;
  for (int i = 0; i < n && p != k; i++) {
    if ((p + 1) * h <= a[i].second.first * t) ans[p++] = a[i].second.second;
  }
  if (p == k) {
    for (int i = 0; i < k; i++) ans2[i] = ans[i];
    return 1;
  }
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> h;
  for (int i = 0; i < n; i++) cin >> a[i].first;
  for (int i = 0; i < n; i++)
    cin >> a[i].second.first, a[i].second.second = i + 1;
  sort(a, a + n);
  long double l = 0, r = (long double)1e12;
  for (int i = 0; i < 200; i++) {
    long double mid = (l + r) / 2;
    if (check(mid))
      r = mid;
    else
      l = mid;
  }
  for (int i = 0; i < k; i++) cout << ans2[i] << " ";
  cout << endl;
  return 0;
}
