#include <bits/stdc++.h>
using namespace std;
int di[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dj[] = {1, -1, 0, 0, 1, -1, 1, -1};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout << fixed << setprecision(10);
  int n, a, d;
  cin >> n >> a >> d;
  vector<double> ans(n);
  vector<pair<pair<int, int>, int> > vec;
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    vec.push_back(make_pair(make_pair(x, y), i));
  }
  int lst = -1;
  sort(vec.begin(), vec.end());
  for (int i = 0; i < n; i++) {
    double answer = 0.0;
    double dt = (1.0 * vec[i].first.second) / (1.0 * a);
    double s = (dt * vec[i].first.second) / 2.0;
    if (s > d) {
      double vf = sqrt(2.0 * a * d);
      answer = vec[i].first.first + (2 * d / vf);
    } else {
      answer = vec[i].first.first + dt + (d - s) / vec[i].first.second;
    }
    if (lst != -1) {
      answer = max(answer, ans[lst]);
    }
    ans[lst = vec[i].second] = answer;
  }
  for (int i = 0; i < n; i++) {
    cout << ans[i] << '\n';
  }
  return 0;
}
