#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 50;
pair<int, pair<int, int> > a[N];
vector<int> ans;
int n, k, h, m[N], v[N];
bool check(long double t) {
  ans.clear();
  int cnt = 1;
  for (int i = 0; i < n; i++) {
    int curv = a[i].second.first;
    int curin = a[i].second.second;
    if (1.0 * curv * t >= 1.0 * cnt * h) {
      ans.push_back(curin);
      cnt++;
    }
  }
  if ((int)ans.size() >= k) return true;
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL), cout.tie(NULL);
  cin >> n >> k >> h;
  for (int i = 1; i <= n; i++) cin >> m[i];
  for (int i = 1; i <= n; i++) cin >> v[i];
  for (int i = 0; i < n; i++)
    a[i] = make_pair(m[i + 1], make_pair(v[i + 1], i + 1));
  sort(a, a + n);
  long double l = 0, r = h * k + 1;
  for (int i = 0; i < 200; i++) {
    long double mid = (l + r) / 2;
    if (check(mid))
      r = mid;
    else
      l = mid;
  }
  check(r);
  for (int i = 0; i < k; i++) cout << ans[i] << " ";
  return 0;
}
