#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const double PI = 3.141592653589793238463;
const int INF = 0x3f3f3f3f;
const int INFS = 1000000000;
const long long LLINF = 9223372036854775807;
const int M = 1000000007;
const int HM = 1000000009;
const int HP = 43;
const double EPS = 1e-8;
long long n, k, h;
vector<pair<long long, pair<long long, long long> > > a;
vector<long long> ans = {};
bool check(long double t) {
  ans.clear();
  for (long long i = 0; i < n; i++) {
    if (ans.size() < k && (ans.size() + 1) * h <= a[i].second.first * t)
      ans.push_back(a[i].second.second);
  }
  return ans.size() == k;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> k >> h;
  a.resize(n);
  for (long long i = 0; i < n; i++) cin >> a[i].first;
  for (long long i = 0; i < n; i++) {
    cin >> a[i].second.first;
    a[i].second.second = i;
  }
  sort(a.begin(), a.end());
  long double l = 0, r = 1000000000000;
  for (long long _ = 0; _ < 200; _++) {
    long double mid = (l + r) / 2;
    if (check(mid)) {
      r = mid;
    } else {
      l = mid;
    }
  }
  check(r);
  for (auto x : ans) cout << x + 1 << ' ';
  cout << endl;
  return 0;
}
