#include <bits/stdc++.h>
const int N = 5010;
const int inf = 1e9;
using namespace std;
int n, t1, t2;
pair<double, int> A[1010];
void solve() {
  ios_base::sync_with_stdio(false);
  double k;
  cin >> n >> t1 >> t2 >> k;
  k = 1 - k / 100;
  for (int i = 0; i < n; i++) {
    int a, b;
    cin >> a >> b;
    A[i].first = max(a * t1 * k + b * t2, b * t1 * k + a * t2);
    A[i].second = -i;
  }
  sort(A, A + n);
  for (int i = n - 1; i >= 0; i--) {
    cout << -A[i].second + 1 << ' ' << fixed << setprecision(2) << A[i].first
         << endl;
  }
}
int main() {
  int TN = 1;
  while (TN--) solve();
  return 0;
}
