#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using db = double;

const int maxn = 222222;
db x[maxn], v[maxn];
int n;
const db inf = 1e18;
db calctime(int i, int j) {
    if (x[i] > x[j]) swap(i, j);
    if (v[i] <= v[j]) return inf;
    return (x[j] - x[i]) / (v[i] - v[j]);
}
db ans[maxn];
void solve() {
    cin >> n;
    for (int i = 0; i <= n; i++) {
        cin >> x[i] >> v[i];
        ans[i] = inf;
    }
    auto run = [&]() {
        static int line[maxn];
        int tp = 0;
        auto getmin = [&](int i) {
            // cout << i << " " << x[i] << " " << v[i] << "emem\n";
            int l = 1, r = tp;
            while (r - l > 10) {
                int lm = (l + l + r) / 3;
                int rm = (l + r + r) / 3;
                db v1 = calctime(i, line[lm]);
                db v2 = calctime(i, line[rm]);
                if (v2 <= v1) {
                    l = lm;
                } else {
                    r = rm;
                }
            }
            db ans = inf;
            for (int j = l; j <= r; j++) {
                ans = min(ans, calctime(i, line[j]));
            }
            // cout<<ans<<"\n";
            return ans;
        };
        vector<int> id(n + 1);
        iota(id.begin(), id.end(), 0);
        sort(id.begin(), id.end(), [&](int a, int b) {
            if (v[a] != v[b]) {
                return v[a] > v[b];
            }
            return x[a] > x[b];
        });
        int meet0 = 0;
        for (int i : id) {
            // cout << x[i] << " " << v[i] << "\n";
            if (i == 0) {
                meet0 = 1;
            }
            if (meet0 == 0) continue;
            if (x[i] < x[0]) continue;
            // cout << "add!\n";
            while (1) {
                if (tp == 0) break;
                if (v[line[tp]] == v[i]) {
                    tp--;
                } else {
                    if (tp == 1) break;
                    db meettime = calctime(line[tp - 1], line[tp]);
                    if (x[i] + v[i] * meettime <= x[line[tp]] + v[line[tp]] * meettime) {
                        tp--;
                    } else
                        break;
                }
            }
            line[++tp] = i;
        }
        vector<int> iline(n + 1);
        assert(line[1] == 0);
        for (int i = 1; i <= tp; i++) {
            // cout << line[i] << " \n"[i == tp];
            iline[line[i]] = 1;
            if (i > 1) {
                ans[line[i]] = min(ans[line[i]], calctime(line[i - 1], line[i]));
            }
        }
        for (int i = 1; i <= n; i++) {
            if (iline[i]) continue;
            if (x[i] >= x[0]) continue;
            // cerr<<ans[i]
            ans[i] = min(ans[i], getmin(i));
        }
    };
    run();
    for (int i = 0; i <= n; i++) {
        x[i] = -x[i], v[i] = -v[i];
    }
    run();
    for (int i = 1; i <= n; i++) {
        if (ans[i] == inf) cout<<"-1\n";else
        cout << fixed << setprecision(20) << ans[i] << "\n";
    }
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}