#include <bits/stdc++.h>
using namespace std;
long long powm(long long base, long long exp, long long mod = 1000000007) {
  long long ans = 1;
  while (exp) {
    if (exp & 1) ans = (ans * base) % mod;
    exp >>= 1, base = (base * base) % mod;
  }
  return ans;
}
long long ctl(char x, char an = 'a') { return (long long)(x - an); }
char ltc(long long x, char an = 'a') { return (char)(x + an); }
long double dp[1005], dist[1005][1005];
long long l, prv[1005], n, x[1005], b[1005];
long double get(long double x) {
  long double sum = 0;
  for (long long i = 1; i < n + 1; i++) {
    dp[i] = 1000111000111000111LL;
    prv[i] = -1;
    long double sub = x * b[i];
    for (long long j = 0; j < i; j++) {
      long double curr = dist[j][i] - sub + dp[j];
      if (curr < dp[i]) {
        dp[i] = curr;
        prv[i] = j;
      }
    }
  }
  return dp[n];
}
int main() {
  cin >> n >> l;
  for (long long i = 1; i < n + 1; i++) cin >> x[i] >> b[i];
  for (long long i = 0; i < n + 1; i++)
    for (long long j = 0; j < n + 1; j++)
      dist[i][j] = sqrt(abs(abs(x[i] - x[j]) - l));
  long double low = 0, high = 1011111111;
  while (high - low > (double)1e-10) {
    long double mid = (low + high) / 2;
    if (get(mid) <= 0)
      high = mid;
    else
      low = mid;
  }
  get(low);
  vector<long long> ans;
  long long curr = n;
  while (curr != 0) ans.push_back(curr), curr = prv[curr];
  reverse((ans).begin(), (ans).end());
  for (auto i : ans) cout << i << " ";
  return 0;
}
