#include <bits/stdc++.h>
using namespace std;
using ld = long double;
const int N = 1e5 + 5;
int n, k, h;
pair<pair<int, int>, int> a[N];
vector<int> ans;
bool ck(ld t) {
  ans.clear();
  int ioi = k;
  for (int i = 0; i < n; i++)
    if (ioi > 0 && a[i].first.second * t >= h * ioi) {
      ans.push_back(a[i].second);
      ioi--;
    }
  return ioi == 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> k >> h;
  for (int i = 0; i < n; i++) cin >> a[i].first.first;
  for (int i = 0; i < n; i++) cin >> a[i].first.second;
  for (int i = 0; i < n; i++) a[i].second = i + 1;
  sort(a, a + n, greater<pair<pair<int, int>, int>>());
  ld l = 0, r = 1e9;
  int _ = 100;
  while (_--) {
    ld mid = (l + r) / 2.0;
    if (!ck(mid))
      l = mid;
    else
      r = mid;
  }
  assert(ck(r));
  reverse(ans.begin(), ans.end());
  for (int x : ans) cout << x << ' ';
  return 0;
}
