#include <bits/stdc++.h>
using namespace std;
const int MaxN = 1100;
int n, t1, t2, k;
int a[MaxN], b[MaxN];
pair<double, int> Ans[MaxN];
int main() {
  cin.sync_with_stdio(0);
  cin >> n >> t1 >> t2 >> k;
  for (int i = 1; i <= n; ++i) cin >> a[i] >> b[i];
  for (int i = 1; i <= n; ++i)
    Ans[i] = make_pair(max(a[i] * t1 * (1.0 - (double)k / 100) + b[i] * t2,
                           b[i] * t1 * (1.0 - (double)k / 100) + a[i] * t2),
                       -i);
  sort(Ans + 1, Ans + n + 1, greater<pair<double, int> >());
  cout << setprecision(2) << fixed;
  for (int i = 1; i <= n; ++i)
    cout << -Ans[i].second << " " << Ans[i].first << endl;
  return 0;
}
