#include <bits/stdc++.h>
using namespace std;
bool mysort(const pair<double, int> &a, const pair<double, int> &b) {
  if (a.first == b.first)
    return a.second < b.second;
  else
    return a.first > b.first;
}
int main() {
  int n, t1, t2, k, a, b, i;
  double h1, h2;
  vector<pair<double, int> > vec;
  cin >> n >> t1 >> t2 >> k;
  for (i = 1; i <= n; i++) {
    cin >> a >> b;
    h1 = (1.0 * a * t1 * (100 - k) / 100) + b * t2;
    h2 = (1.0 * b * t1 * (100 - k) / 100) + a * t1;
    h1 = a * t1 * (1 - (k * 1.0) / 100) + b * t2;
    h2 = b * t1 * (1 - (k * 1.0) / 100) + a * t2;
    vec.push_back(make_pair(max(h1, h2), i));
  }
  sort(vec.begin(), vec.end(), mysort);
  for (i = 0; i < vec.size(); i++)
    cout << vec[i].second << " " << fixed << setprecision(2) << vec[i].first
         << endl;
}
