#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int INF = 1000000000;
const int MOD = 1000000007;
int main() {
  long double n, a, d;
  cin >> n >> a >> d;
  vector<pair<long double, long double> > mas(n);
  for (int i = 0; i < n; i++) {
    cin >> mas[i].first >> mas[i].second;
  }
  vector<long double> rez;
  long double s = 0;
  long double t;
  for (int i = 0; i < n; i++) {
    t = 0;
    s = (long double)(mas[i].second * mas[i].second) / (2 * a);
    if (d > s) {
      t += sqrt((2 * s) / a);
      t += (d - s) / mas[i].second;
    } else {
      t += sqrt(2 * d / a);
    }
    rez.push_back(t + mas[i].first);
  }
  printf("%.10f", (double)rez[0]);
  cout << endl;
  for (int i = 1; i < n; i++) {
    if (rez[i] < rez[i - 1]) {
      rez[i] = rez[i - 1];
    }
    printf("%.10f", (double)rez[i]);
    cout << endl;
  }
  return 0;
}
