#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 10;
struct node {
  int t, v;
} ed[N];
double ans[N];
int main() {
  double n, a, d;
  scanf("%lf%lf%lf", &n, &a, &d);
  for (int i = 1; i <= n; i++) {
    double t, v;
    scanf("%lf%lf", &t, &v);
    if (v * v >= 2 * a * d)
      ans[i] = sqrt(2 * d / a) + t;
    else {
      double tmp = v * v / 2 / a;
      double x = tmp;
      tmp = d - tmp;
      ans[i] = tmp / v + sqrt(2 * x / a) + t;
    }
  }
  for (int i = 2; i <= n; i++) {
    ans[i] = max(ans[i], ans[i - 1]);
  }
  for (int i = 1; i <= n; i++) printf("%.7f\n", ans[i]);
  return 0;
}
