#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const double EPS = 1e-11;
const double PI = 2 * acos(0.0);
using ll = long long;
using ull = unsigned long long;
struct data {
  int a, b, pos;
  double height;
} D[1007];
int n, t1, t2, k;
double calculate(int a, int b) {
  double p = (double)k / 100.0;
  double xx = a * t1 * p;
  return (double)((a * t1) - xx) + (b * t2);
}
bool cmp(const data a, const data b) {
  if (a.height == b.height) return a.pos < b.pos;
  return a.height > b.height;
}
int main() {
  scanf("%d %d", &n, &t1);
  scanf("%d %d", &t2, &k);
  for (int i = 0; i < n; i++) {
    int first, second;
    scanf("%d %d", &first, &second);
    D[i].a = first;
    D[i].b = second;
    D[i].pos = i + 1;
  }
  for (int i = 0; i < n; i++) {
    double mx = max(calculate(D[i].a, D[i].b), calculate(D[i].b, D[i].a));
    D[i].height = mx;
  }
  sort(D, D + n, cmp);
  for (int i = 0; i < n; i++) {
    printf("%d %0.2llf\n", D[i].pos, D[i].height);
  }
  return 0;
}
