#include <bits/stdc++.h>
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
using namespace std;
long long gcd(long long x, long long y) { return (!y) ? x : gcd(y, x % y); }
long long lcm(long long x, long long y) { return ((x / gcd(x, y)) * y); }
void file() {}
void fast() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(NULL);
}
vector<pair<double, int>> v;
int main() {
  fast();
  file();
  double n, t1, t2, k;
  cin >> n >> t1 >> t2 >> k;
  for (int i = 1; i <= n; i++) {
    double a, b;
    cin >> a >> b;
    double sum = 0;
    sum = max(((((a * t1) + (b * t2)) - (a * t1) * (k / 100.0))),
              (((a * t2) + (b * t1)) - (b * t1) * (k / 100.0)));
    v.push_back({sum, i});
  }
  sort(v.rbegin(), v.rend());
  for (int i = 0; i < v.size(); i++) {
    for (int j = i + 1; j < v.size(); j++) {
      if (v[j].first > v[i].first) {
        swap(v[j].first, v[i].first);
      } else if (v[j].first == v[i].first) {
        if (v[i].second > v[j].second) {
          swap(v[i].second, v[j].second);
        }
      }
    }
  }
  for (int i = 0; i < v.size(); i++) {
    cout << v[i].second << " " << fixed << setprecision(2) << v[i].first
         << "\n";
  }
}
