#include <bits/stdc++.h>
using namespace std;
int main() {
  double n, a, d, p, q;
  cin >> n >> a >> d;
  vector<double> final;
  vector<pair<double, double> > v;
  for (long long int i = 0; i < n; i++) {
    cin >> p >> q;
    v.push_back(make_pair(p, q));
  }
  sort(v.begin(), v.end());
  for (long long int j = 0; j < v.size(); j++) {
    double t = (v[j].first);
    double vel = v[j].second;
    double maxtime = (vel / a);
    double dist = (a * maxtime * maxtime) / 2.000000000;
    if (dist >= d) {
      double time = sqrt((2.00000000 * d) / a);
      final.push_back(time + t);
    } else {
      double remdist = d - dist;
      double remtime = (remdist / vel);
      double g = remtime + maxtime + v[j].first;
      final.push_back(g);
    }
  }
  cout << final[0] << endl;
  double prev = final[0];
  for (long long int j = 1; j < final.size(); j++) {
    if (final[j] <= prev) {
      printf("%f\n", prev);
      continue;
    } else {
      prev = final[j];
      printf("%f\n", final[j]);
    }
  }
  return 0;
}
