#include <bits/stdc++.h>
int main() {
  using namespace std;
  int num, t1, t2, k;
  cin >> num >> t1 >> t2 >> k;
  double ms[1000];
  double ms2[1000];
  for (int i = 0; i < 1000; i++) {
    ms[i] = 0;
    ms2[i] = 0;
  }
  for (int i = 0; i < num; i++) {
    int a, b;
    cin >> a >> b;
    double s1, s2;
    s1 = a * t1 * ((100 - k) / 100.0) + t2 * b;
    s2 = b * t1 * ((100 - k) / 100.0) + t2 * a;
    if (s1 >= s2)
      ms[i] = s1;
    else
      ms[i] = s2;
    ms2[i] = ms[i];
  }
  stable_sort(ms, ms + num);
  int same;
  for (int i = num - 1; i >= 0; i--) {
    if (i < num - 1 && ms[i] == ms[i + 1])
      same++;
    else
      same = 0;
    int p;
    int pass = same;
    for (int j = 0; j < num; j++) {
      if (ms2[j] == ms[i]) {
        if (pass > 0) {
          pass--;
          continue;
        }
        p = j + 1;
        break;
      }
    }
    double d = ((int)(ms[i] * 100 + 0.5)) / 100.0;
    printf("%d %3.2f\n", p, d);
  }
}
