Problem: In some country live wizards. They love to ride trolleybuses.

A city in this country has a trolleybus depot with n trolleybuses. Every day the trolleybuses leave the depot, one by one and go to the final station. The final station is at a distance of d meters from the depot. We know for the i-th trolleybus that it leaves at the moment of time ti seconds, can go at a speed of no greater than vi meters per second, and accelerate with an acceleration no greater than a meters per second squared. A trolleybus can decelerate as quickly as you want (magic!). It can change its acceleration as fast as you want, as well. Note that the maximum acceleration is the same for all trolleys.

Despite the magic the trolleys are still powered by an electric circuit and cannot overtake each other (the wires are to blame, of course). If a trolleybus catches up with another one, they go together one right after the other until they arrive at the final station. Also, the drivers are driving so as to arrive at the final station as quickly as possible.

You, as head of the trolleybuses' fans' club, are to determine for each trolley the minimum time by which it can reach the final station. At the time of arrival at the destination station the trolleybus does not necessarily have zero speed. When a trolley is leaving the depot, its speed is considered equal to zero. From the point of view of physics, the trolleybuses can be considered as material points, and also we should ignore the impact on the speed of a trolley bus by everything, except for the acceleration and deceleration provided by the engine.

Input

The first input line contains three space-separated integers n, a, d (1 ≤ n ≤ 105, 1 ≤ a, d ≤ 106) — the number of trolleybuses, their maximum acceleration and the distance from the depot to the final station, correspondingly.

Next n lines contain pairs of integers ti vi (0 ≤ t1 < t2... < tn - 1 < tn ≤ 106, 1 ≤ vi ≤ 106) — the time when the i-th trolleybus leaves the depot and its maximum speed, correspondingly. The numbers in the lines are separated by spaces.

Output

For each trolleybus print a single line the time it arrives to the final station. Print the times for the trolleybuses in the order in which the trolleybuses are given in the input. The answer will be accepted if the absolute or relative error doesn't exceed 10 - 4.

Examples

Input

3 10 10000
0 10
5 11
1000 1


Output

1000.5000000000
1000.5000000000
11000.0500000000


Input

1 2 26
28 29


Output

33.0990195136

Note

In the first sample the second trolleybus will catch up with the first one, that will happen at distance 510.5 meters from the depot. The trolleybuses will go the remaining 9489.5 meters together at speed 10 meters per second. As a result, both trolleybuses will arrive to the final station by the moment of time 1000.5 seconds. The third trolleybus will not catch up with them. It will arrive to the final station by the moment of time 11000.05 seconds.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n;
double d, acc;
double st[N], v[N];
int sk[N], top, pa[N];
double arr[N];
int find(int x) { return pa[x] == -1 ? x : pa[x] = find(pa[x]); }
void merge(int x, int y) {
  x = find(x), y = find(y);
  if (x != y) pa[x] = y;
}
int main() {
  int i, j;
  scanf("%d%lf%lf", &n, &acc, &d);
  for (int i = (1); i < (n + 1); i++) {
    scanf("%lf%lf", &st[i], &v[i]);
    double tacc = v[i] / acc;
    double dacc = 0.5 * acc * tacc * tacc;
    if (dacc > d - 1e-12)
      arr[i] = sqrt(2 * d / acc) + st[i];
    else
      arr[i] = st[i] + v[i] / acc + max(d - 0.5 * acc * tacc * tacc, .0) / v[i];
  }
  memset(pa, -1, sizeof(pa));
  sk[top = 1] = 1;
  for (i = 2; i <= n; i++) {
    if (arr[i] - 1e-12 < arr[sk[top]])
      merge(i, sk[top]);
    else {
      sk[++top] = i;
    }
  }
  for (int i = (1); i < (n + 1); i++) {
    j = find(i);
    printf("%.9lf\n", arr[j]);
  }
  return 0;
}