#include <bits/stdc++.h>
using namespace std;
bool comp(pair<double, int> &a, pair<double, int> &b) {
  if (a.first != b.first) return a.first > b.first;
  return a.second < b.second;
}
void solve() {
  int n;
  double t1, t2, k;
  cin >> n >> t1 >> t2 >> k;
  vector<pair<double, int>> p(n);
  for (int i = 0; i < (n); i++) {
    double a, b;
    cin >> a >> b;
    p[i].second = i + 1;
    p[i].first = max(a * t1 - (a * t1 * k) / 100 + b * t2,
                     b * t1 - (b * t1 * k) / 100 + a * t2);
  }
  sort(p.begin(), p.end(), comp);
  for (auto x : p)
    cout << x.second << " " << setprecision(2) << fixed << x.first << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  while (t--) solve();
}
