#include <bits/stdc++.h>
int main() {
  int n, t1, t2, k;
  scanf("%d%d%d%d", &n, &t1, &t2, &k);
  int a[n], b[n];
  double ans[n];
  for (int i = 0; i < n; i++) scanf("%d%d", &a[i], &b[i]);
  for (int j = 0; j < n; j++) {
    double cond1 = a[j] * t1 * (1 - double(k) / 100) + b[j] * t2;
    double cond2 = b[j] * t1 * (1 - double(k) / 100) + a[j] * t2;
    double larger = 0.000;
    if (cond1 > cond2)
      larger = cond1;
    else
      larger = cond2;
    ans[j] = larger;
  }
  int num_ans[n], answ[n], tmp, index[n];
  double tmp1;
  for (int q = 0; q < n; q++) index[q] = q + 1;
  for (int x = 1; x < n; x++) {
    for (int z = n - 1; z >= x; z--) {
      if (ans[z] > ans[z - 1]) {
        tmp1 = ans[z - 1];
        ans[z - 1] = ans[z];
        ans[z] = tmp1;
        tmp = index[z - 1];
        index[z - 1] = index[z];
        index[z] = tmp;
      }
    }
  }
  for (int y = 0; y <= n - 1; y++) printf("%d %0.2lf\n", index[y], ans[y]);
  return 0;
}
