#include <bits/stdc++.h>
using namespace std;
const long double inf = 1e18;
int n, L;
int x[1001];
int b[1001];
int trace[1001];
long double f[1001];
bool check(long double mid) {
  f[0] = 0;
  for (int i = 1; i <= n; i++) {
    f[i] = inf;
    for (int j = 0; j < i; j++) {
      long double val = f[j] - mid * b[i] + sqrt(abs(x[i] - x[j] - L));
      if (f[i] > val) {
        f[i] = val;
        trace[i] = j;
      }
    }
  }
  return f[n] < 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> L;
  for (int i = 1; i <= n; i++) cin >> x[i] >> b[i];
  long double l = 0, r = inf, m;
  while (r - l > 1e-9) {
    m = (l + r) / 2;
    if (check(m)) {
      r = m;
    } else
      l = m;
  }
  check(m);
  vector<int> ans;
  while (n > 0) {
    ans.push_back(n);
    n = trace[n];
  }
  for (int i = ans.size() - 1; i >= 0; i--) cout << ans[i] << ' ';
  return 0;
}
