#include <bits/stdc++.h>
using namespace std;
int n, t1, t2, k;
int id[1000];
double h[1000];
void Sort(int l, int r) {
  int i = l, j = r, x = id[(l + r) >> 1];
  double d = h[(l + r) >> 1];
  do {
    while (h[i] - d > 1e-9 || (fabs(h[i] - d) < 1e-9 && id[i] < x)) ++i;
    while (d - h[j] > 1e-9 || (fabs(h[j] - d) < 1e-9 && x < id[j])) --j;
    if (i <= j) {
      int tmp1 = id[i];
      id[i] = id[j];
      id[j] = tmp1;
      double tmp2 = h[i];
      h[i] = h[j];
      h[j] = tmp2;
      ++i;
      --j;
    }
  } while (i <= j);
  if (l < j) Sort(l, j);
  if (i < r) Sort(i, r);
}
int main() {
  int a, b;
  scanf("%d %d %d %d", &n, &t1, &t2, &k);
  for (int i = 0; i < n; ++i) {
    scanf("%d %d", &a, &b);
    id[i] = i + 1;
    h[i] = t1 * a - (k * t1 * a / 100.0) + t2 * b;
    h[i] = max(h[i], t1 * b - (k * t1 * b / 100.0) + t2 * a);
  }
  Sort(0, n - 1);
  for (int i = 0; i < n; ++i) {
    printf("%d %.2lf\n", id[i], h[i]);
  }
  return 0;
}
