#pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

#define X first
#define Y second


const ll mod = 1000000007;
//const ll mod = 998244353;



ll pew(ll a, ll b) {
    ll res = 1;
    while (b>0) {
        if (b&1) res = res*a%mod;
        b >>= 1;
        a = a*a%mod;
    }
    return res;
}



ll area(pair<ll,ll> a, pair<ll,ll> b, pair<ll,ll> c) {
    return (b.X-a.X)*(c.Y-a.Y)-(b.Y-a.Y)*(c.X-a.X);
}

void solve() {
    ll n;
    pair<ll,ll> st;
    cin >> n >> st.X >> st.Y;
    vector<pair<ld,ld>> a(n);
    for (ll i=0;i<n;i++) {
        cin >> a[i].X >> a[i].Y;
    }
    cout.precision(20);
    for (ll t=1;t+1<n;t++) {
        vector<ll> cur = {0,t,t+1};
        ll F = 0;
        for (ll w=0;w<3;w++) {
            if (area(a[cur[w]],a[cur[(w+1)%3]],st)<0) F = 1;
        }
        if (F==1) continue;
        ll k = 3;
        vector<vector<ld>> A(k,vector<ld>(k+1));
        for (ll i=0;i<k;i++) {
            A[0][i] = a[cur[i]].X;
            A[1][i] = a[cur[i]].Y;
            A[2][i] = 1;
        }
        A[0][3] = st.X, A[1][3] = st.Y, A[2][3] = 1;
        for (ll i=0;i<k;i++) {
            for (ll j=i+1;j<k;j++) {
                if (abs(A[j][i])>abs(A[i][i])) swap(A[i],A[j]);
            }
            for (ll j=i+1;j<k;j++) {
                ld r = A[j][i]/A[i][i];
                for (ll w=i;w<=k;w++) A[j][w] -= r*A[i][w];
            }
        }
        vector<ld> A0(3);
        for (ll i=k-1;i>=0;i--) {
            A0[i] = A[i][k];
            for (ll j=i+1;j<k;j++) A0[i] -= A0[j]*A[i][j];
            A0[i] /= A[i][i];
        }
        vector<ld> ans(n);
        for (ll w=0;w<3;w++) ans[cur[w]] = A0[w];
        for (ll i=0;i<n;i++) cout << ans[i] << "\n";
        return;
    }
    assert(false);
}

int main() {
    ios_base::sync_with_stdio(false);
    int T = 1;
    //cin >> T;
    while (T--) solve();
    return 0;
}