#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, ##__VA_ARGS__)
#else
#define endl "\n"
#define debug(...) void(0)
#endif
using LL = long long;
using point = complex<double>;
int n;
pair<double, int> b[30];
point tar, ans[30];
int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);  
#endif
  cin >> n;
  int sum = 0;
  for (int i = 1; i <= n; i++) cin >> b[i].first, sum += b[i].first, b[i].second = i;
  {/*{{{*/
    double tx, ty;
    cin >> tx >> ty;
    tar = point{tx, ty};
  }/*}}}*/
  if (sum > abs(tar)) {
    sort(b + 1, b + n + 1);
    double pre = 0;
    for (int i = 1; i <= n; i++) {
      pre += b[i].first;
      int id = b[i].second;
      if (sum - pre * 2 - abs(tar) <= 1e-4) {
        double a = b[i].first, b = pre - a + abs(tar), c = sum - pre;
        if (a + b + c > 2 * max({a, b, c})) {
          double angc = acos((a * a + b * b - c * c) / (2 * a * b));
          point tmp = ans[id] = polar(a, angc);
          point all = (b - tmp) / c;
          for (int j = i + 1; j <= n; j++) ans[::b[j].second] = all * ::b[j].first;
        } else {
          if (fabs(a + b + c - max({a, b, c})) <= 1e-4) ans[id] = -a;
          else ans[id] = a;
          for (int j = i + 1; j <= n; j++) ans[::b[j].second] = ::b[j].first;
        }
        break;
      }
      ans[b[i].second] = -b[i].first;
    }
  } else {
    for (int i = 1; i <= n; i++) ans[b[i].second] = b[i].first;
  }
  point now = 0;
  cout << fixed << setprecision(6);
  for (int i = 1; i <= n; i++) {
    now += ans[i] * polar(1., arg(tar));
    cout << real(now) << " " << imag(now) << endl;
  }
  return 0;
}