//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")

#include <bits/stdc++.h>

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef KIVI
#define DEBUG for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define DEBUG while (false)
#define LOG(...)
#endif

const int max_n = -1, inf = 1000111222;

const ld PI = acos(-1.0);

inline ld sqr (ld x) {
    return x * x;
}

inline ld dist (ld x0, ld y0, ld x1, ld y1) {
    return sqrtl(sqr(x0 - x1) + sqr(y0 - y1));
}

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;
    vector <pii> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(all(a));
    reverse(all(a));
    ld x, y;
    cin >> x >> y;
    ld X = 0, Y = 0;
    cout << fixed;
    cout.precision(10);
    auto f = [&] (int pos, ld angle) -> ld {
        ld tox = X + a[pos - 1].first * cos(angle);
        ld toy = Y + a[pos - 1].first * sin(angle);
        if (pos == n) {
            return dist(x, y, tox, toy);
        }
        ld L = a[pos].first, R = a[pos].first;
        for (int i = pos + 1; i < n; i++) {
            R += a[i].first;
            L -= a[i].first;
        }
        umax(L, ld(0));
        ld cur_x = x - tox;
        ld cur_y = y - toy;
        ld d = dist(cur_x, cur_y, 0, 0);
        if (d >= L && d <= R) {
            return 0;
        }
        if (d < L) {
            return L - d;
        }
        return d - R;
    };
    vector <pair<ld, ld> > ans(n);
    for (int i = 0; i < n; i++) {
        ld l = 0, r = 2 * PI;
        for (int it = 0; it < 60; it++) {
            ld m1 = l + (r - l) / 3;
            ld m2 = r - (r - l) / 3;
            if (f(i + 1, m1) < f(i + 1, m2)) {
                r = m2;
            }
            else {
                l = m1;
            }
        }
        ld angle = (l + r) / 2.0;
        ans[a[i].second].first = a[i].first * cos(angle);
        ans[a[i].second].second = a[i].first * sin(angle);
        X += ans[a[i].second].first;
        Y += ans[a[i].second].second;
    }
    X = 0;
    Y = 0;
    for (auto &i : ans) {
        X += i.first;
        Y += i.second;
        cout << X << ' ' << Y << '\n';
    }
}