#include <bits/stdc++.h>
using namespace std;
const int N = 110000;
int n;
double a, d, t[N], v[N];
int main() {
  scanf("%d%lf%lf", &n, &a, &d);
  double maxt = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%lf%lf", &t[i], &v[i]);
    double t1 = v[i] / a;
    double d1 = 0.5 * a * t1 * t1;
    double d2 = d - d1;
    double t2, t3;
    if (d2 < 0) {
      t3 = sqrt(2 * d / a);
      t3 = t3 + t[i];
    } else {
      t2 = d2 / v[i];
      t3 = t1 + t2 + t[i];
    }
    if (t3 > maxt) {
      cout << t3 << endl;
      maxt = t3;
    } else {
      cout << maxt << endl;
    }
  }
  return 0;
}
