#include <bits/stdc++.h>
using namespace std;
const long long INF = 9113982052354876807;
const long long N = 2e5 + 5;
void solves() {
  long long n, t1, t2, k;
  cin >> n >> t1 >> t2 >> k;
  vector<pair<double, long long> > v(n);
  double k1 = 1.0 - 0.01 * k;
  for (int i = 0; i < n; i++) {
    long long a, b;
    cin >> a >> b;
    double first = a * t1 * k1 + b * t2;
    double second = b * t1 * k1 + a * t2;
    double maxi = max(first, second);
    v[i].first = maxi;
    v[i].second = -i;
  }
  sort(v.begin(), v.end());
  reverse(v.begin(), v.end());
  for (int i = 0; i < n; i++)
    cout << -v[i].second + 1 << " " << fixed << setprecision(2) << v[i].first
         << endl;
  return;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  solves();
  return 0;
}
