#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 3;
int n, l;
pair<int, int> a[MAXN];
void read() {
  cin >> n >> l;
  for (int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
}
long double dp[MAXN];
int par[MAXN];
bool can(long double x) {
  for (int i = 1; i <= n; i++) {
    dp[i] = -1e9;
    for (int j = 0; j <= i - 1; j++)
      if (dp[j] + x * a[i].second -
              sqrt(fabs(a[i].first - a[j].first - l) * 1.0) >
          dp[i])
        dp[i] = dp[j] + x * a[i].second -
                sqrt(fabs(a[i].first - a[j].first - l) * 1.0),
        par[i] = j;
  }
  return dp[n] >= 0;
}
void solve() {
  long double low = 0, high = 1e9;
  for (int i = 1; i <= 100; i++) {
    long double mid = (low + high) / 2;
    if (can(mid))
      high = mid;
    else
      low = mid;
  }
  vector<int> ans;
  int pos = n;
  while (pos) {
    ans.push_back(pos);
    pos = par[pos];
  }
  reverse(ans.begin(), ans.end());
  for (auto i : ans) cout << i << " ";
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  read();
  solve();
}
