#include <bits/stdc++.h>
using namespace std;
long long spf[300001];
long long fac[300001];
void sieve() {
  spf[1] = 1;
  for (long long i = 2; i < 300001; i++) spf[i] = i;
  for (long long i = 4; i < 300001; i += 2) spf[i] = 2;
  for (long long i = 3; i * i < 300001; i++) {
    if (spf[i] == i) {
      for (long long j = i * i; j < 300001; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
map<long long, long long> getfactor(long long a) {
  map<long long, long long> m;
  while (a > 1) {
    m[spf[a]]++;
    a /= spf[a];
  }
  return m;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long inverse(long long a, long long p) { return power(a, p - 2, p); }
long long ncr(long long n, long long r, long long p) {
  if (r == 0) return 1;
  return (fac[n] * inverse(fac[r], p) % p * inverse(fac[n - r], p) % p) % p;
}
long long n, k, h;
long long m[100001], v[100001];
long long ans[100001] = {0};
long long temp[100001];
pair<pair<long long, long long>, long long> p[100001];
bool check(long double mid) {
  long long j = k;
  for (long long i = n; i >= 1; i--) {
    long double gg = j * h;
    if (gg / p[i].first.second <= mid + 1e-14) {
      temp[j] = p[i].second;
      j--;
    }
    if (j == 0) {
      for (long long ll = 1; ll <= k; ll++) ans[ll] = temp[ll];
      return true;
    }
  }
  return false;
}
void solve() {
  cin >> n >> k >> h;
  for (long long i = 1; i <= n; i++) cin >> m[i];
  for (long long i = 1; i <= n; i++) cin >> v[i];
  for (long long i = 1; i <= n; i++) p[i] = make_pair(make_pair(m[i], v[i]), i);
  sort(p + 1, p + n + 1);
  long double l = 0, r = h * k;
  long long count = 0;
  while (count < 100) {
    long double mid = (l + r) / 2;
    if (check(mid))
      r = mid;
    else
      l = mid;
    count++;
  }
  for (long long i = 1; i <= k; i++) cout << ans[i] << " ";
  cout << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long test = 1;
  while (test--) {
    solve();
  }
}
