#include <bits/stdc++.h>
using namespace std;
int n, t1, t2, k;
int a, b;
vector<pair<double, int> > u;
double nn;
bool cmp(pair<double, int> a, pair<double, int> b) {
  return (a.first == b.first) ? (a.second < b.second) : (a.first > b.first);
}
int main() {
  cin >> n >> t1 >> t2 >> k;
  for (int(i) = (1); (i) <= (n); ++(i)) {
    cin >> a >> b;
    if (a * t1 * (100 - k) + 100 * b * t2 > b * t1 * (100 - k) + 100 * a * t2)
      u.push_back(make_pair((a * t1 * (100 - k) / 100.0 + b * t2), (i)));
    else
      u.push_back(make_pair((b * t1 * (100 - k) / 100.0 + a * t2), (i)));
  }
  sort(u.begin(), u.end(), cmp);
  for (int(i) = (0); (i) <= (n - 1); ++(i)) {
    cout << u[i].second << " " << setprecision(2) << fixed << u[i].first
         << endl;
  }
  return 0;
}
