#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)1e5 + 6;
const int inf = (int)1e9;
const int mod = (int)1e9 + 7;
int n, t, s, k;
inline double calc(int a, int b) {
  double buf = (double)(a * t * (100 - k)) / 100 + b * s;
  double buf2 = (double)(b * t * (100 - k)) / 100 + a * s;
  return max(buf, buf2);
}
int main() {
  while (scanf("%d %d %d %d", &n, &t, &s, &k) != EOF) {
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) {
      scanf("%d %d", &a[i], &b[i]);
    }
    vector<pair<double, int> > ans(n);
    for (int i = 0; i < n; i++) {
      ans[i].first = calc(a[i], b[i]);
      ans[i].second = -i;
    }
    sort(ans.rbegin(), ans.rend());
    for (int i = 0; i < (int)ans.size(); i++) {
      printf("%d %.2lf\n", -ans[i].second + 1, ans[i].first);
    }
  }
  return 0;
}
