#include <bits/stdc++.h>
using namespace std;
template <typename TH>
void _dbg(const char *sdbg, TH h) {
  cerr << sdbg << "=" << h << "\n";
}
template <typename TH, typename... TA>
void _dbg(const char *sdbg, TH h, TA... t) {
  while (*sdbg != ',') {
    cerr << *sdbg++;
  }
  cerr << "=" << h << ",";
  _dbg(sdbg + 1, t...);
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
  return a * b / gcd(a, b);
}
vector<string> split(string s) {
  istringstream buf(s);
  istream_iterator<string> beg(buf), end;
  vector<string> list(beg, end);
  return list;
}
bool isvowel(char c) {
  string s = "aeiouAEIOU";
  if (find(s.begin(), s.end(), c) != s.end()) return true;
  return false;
}
vector<long long> sieve(long long n) {
  vector<bool> prime(n + 1, true);
  prime[0] = prime[1] = 0;
  for (int i = 2; i * i <= n; i++) {
    if (prime[i])
      for (int j = i * i; j <= n; j += i) {
        prime[j] = 0;
      }
  }
  vector<long long> p;
  for (int i = 2; i <= prime.size(); i++)
    if (prime[i]) p.push_back(i);
  return p;
}
bool isprime(int n) {
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true && (n != 1);
}
int ncr(long long n, long long r) {
  long long C[r + 1];
  memset(C, 0, sizeof(C));
  C[0] = 1;
  for (long long i = 1; i <= n; i++) {
    for (long long j = min(i, r); j > 0; j--)
      C[j] = (C[j] + C[j - 1]) % 1000000007;
  }
  return C[r];
}
bool special(string s) {
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == ' ') continue;
    if (s[i] == '#')
      return true;
    else
      return false;
  }
  return false;
}
void solve() {
  cout << fixed << setprecision(10);
  double n, a, d;
  cin >> n >> a >> d;
  vector<pair<int, int> > v(n);
  double max_ans = 0;
  for (int i = 0; i < n; i++) {
    cin >> v[i].first >> v[i].second;
    double s1 = 1.0 * v[i].second * v[i].second / (2 * a);
    double t = v[i].first;
    if (d < s1) {
      t += sqrt(2 * d / a);
    } else {
      t += 1.0 * v[i].second / a + (d - s1) / v[i].second;
    }
    max_ans = max(t, max_ans);
    cout << max_ans << '\n';
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) solve();
  return 0;
}
