#include <bits/stdc++.h>
using namespace std;
int n, l;
int x[1100], b[1100];
double dp[1100];
int pre[1100];
double check(double p) {
  int i, j;
  for (i = 1; i <= n; i++) dp[i] = 1e30, pre[i] = 0;
  dp[0] = 0;
  for (i = 1; i <= n; i++) {
    for (j = 0; j < i; j++) {
      if (dp[j] + sqrt(abs(x[i] - x[j] - l)) < dp[i]) {
        dp[i] = dp[j] + sqrt(abs(x[i] - x[j] - l));
        pre[i] = j;
      }
    }
    dp[i] -= p * b[i];
  }
  return dp[n];
}
void out(int a) {
  if (pre[a] != 0) out(pre[a]);
  printf("%d ", a);
}
int main() {
  int i;
  cin >> n >> l;
  for (i = 1; i <= n; i++) cin >> x[i] >> b[i];
  x[0] = 0;
  double l = 0, r = 1e15;
  while (r - l >= 1e-8) {
    double mid = (r + l) / 2.0;
    if (check(mid) >= 0) {
      l = mid;
    } else {
      r = mid;
    }
  }
  out(n);
  return 0;
}
