#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, n;
  double t1, t2, k, a, b, mx;
  cin >> n >> t1 >> t2 >> k;
  vector<pair<double, int> > v;
  for (i = 0; i < n; ++i) {
    cin >> a >> b;
    mx = max((t1 * a * (1.0 - k / 100.0)) + t2 * b,
             (t1 * b * (1.0 - k / 100.0)) + t2 * a);
    v.push_back(make_pair(mx, -i));
  }
  sort(v.begin(), v.end());
  for (i = n - 1; i >= 0; --i)
    printf("%d %.2lf\n", -v[i].second + 1, v[i].first);
  return 0;
}
