#include <bits/stdc++.h>
using namespace std;
int n;
double a, d;
double t[100100], v[100100];
void calc(int k) {
  double vt = v[k], s = vt * vt / (2 * a);
  double ret = 0;
  if (s >= d) {
    ret = sqrt(2 * d / a);
  } else {
    s = d - s;
    ret = vt / a;
    ret += s / vt;
  }
  t[k] = max(t[k - 1], ret + t[k]);
}
int main() {
  t[0] = 0;
  v[0] = 1;
  scanf("%d%lf%lf", &n, &a, &d);
  for (int i = 1; i <= n; i++) scanf("%lf%lf", &t[i], &v[i]);
  for (int i = 1; i <= n; i++) calc(i);
  for (int i = 1; i <= n; i++) printf("%lf\n", t[i]);
  return 0;
}
