#include <bits/stdc++.h>
using namespace std;
int n, t1, t2, k, a[1005], b[1005];
vector<pair<double, int> > ans;
bool cmp(pair<double, int> x, pair<double, int> y) {
  if (fabs(x.first - y.first) < 1e-5) return x.second < y.second;
  return x.first > y.first;
}
double h(int x, int y) {
  return (double)x * t1 * (100.0 - k) / 100.0 + (double)y * t2;
}
int main() {
  scanf("%d%d%d%d", &n, &t1, &t2, &k);
  for (int i = 0; i < n; ++i) scanf("%d%d", &a[i], &b[i]);
  for (int i = 0; i < n; ++i) {
    ans.push_back(make_pair(max(h(a[i], b[i]), h(b[i], a[i])), i));
  }
  sort((ans).begin(), (ans).end(), cmp);
  for (int i = 0; i < n; ++i)
    printf("%d %.2lf\n", ans[i].second + 1, ans[i].first);
  return 0;
}
