#include <bits/stdc++.h>
using namespace std;
struct mem {
  int a, b;
} a[1001];
int n, t1, t2, k;
pair<double, int> ans[1001];
bool cmp(pair<double, int> a, pair<double, int> b) {
  if (a.first == b.first)
    return a.second < b.second;
  else
    return a.first > b.first;
}
int main() {
  scanf("%d%d%d%d", &n, &t1, &t2, &k);
  for (int i = 1; i <= n; ++i) scanf("%d %d", &a[i].a, &a[i].b);
  for (int i = 1; i <= n; ++i) {
    ans[i].first =
        max(a[i].a * t1 - ((double)(a[i].a * t1) / 100.0) * k + a[i].b * t2,
            a[i].b * t1 - ((double)(a[i].b * t1) / 100.0) * k + a[i].a * t2);
    ans[i].second = i;
  }
  sort(ans + 1, ans + n + 1, cmp);
  for (int i = 1; i <= n; ++i)
    printf("%d %.2lf\n", ans[i].second, ans[i].first);
}
