#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}


int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

int w, h, a, b, ab;

ld calc_arc(ld a1, ld a2, ld b) {
	ld s1 = a1 * a1 + a2 * a2 - b * b;
	ld s2 = 2 * a1*a2;
	return acos(s1 / s2);
}

void solve() {
	a -= ab; b -= ab;
	if (a < 0 || b < 0) {
		cout << "impossible" << endl; return;
	}
	ld s1 = a + ab;
	ld s2 = b + ab;
	ld r1 = sqrt(s1 / pi);
	ld r2 = sqrt(s2 / pi);
	bool sw = false;
	if (r1 < r2) {
		swap(r1, r2);
		swap(a, b);
		sw = true;
	}
	ld d;
	if (ab == 0)d = r1 + r2;
	else {
		ld l = 0, r = r1 + r2;
		rep(aa, 100) {
			d = (l + r) / 2.0;
			if (d + r2 <= r1) {
				l = d; continue;
			}
			ld t1 = calc_arc(d, r1, r2); t1 *= 2;
			ld t2 = calc_arc(d, r2, r1); t2 *= 2;
			ld area = 0;
			assert(t1 > sin(t1) - eps);
			//assert(t2 > sin(t2) - eps);
			assert(t1 < pi + eps);
			//assert(t2 < pi + eps);
			area += r1 * r1*t1 / 2.0 - r1 * r1*sin(t1) / 2.0;
			area += r2 * r2*t2 / 2.0 - r2 * r2*sin(t2) / 2.0;

			if (area < ab)r = d;
			else l = d;
		}
	}
	ld x1 = r1, y1 = r1;
	if (x1+r1 > w || y1 +r1 > h) {
		cout << "impossible" << endl;
		return;
	}
	ld l = 0, r = 1;
	rep(aa, 100) {
		ld m = (l + r) / 2.0;
		ld dx = d * sqrt(1-m*m);
		ld dy = d * m;
		ld x2 = x1 + dx;
		ld y2 = y1 + dy;
		if (x2 + r2 > w)l = m;
		else r = m;
	}
	ld m = r;
	ld dx = d * sqrt(1-m*m);
	ld dy = d * m;
	ld x2 = x1 + dx;
	ld y2 = y1 + dy;
	assert(x1 - r1 >= -0.0001);
	assert(x2 - r2 >= -0.0001);
	assert(y1 - r1 >= -0.0001);
	assert(y2 - r2 >= -0.0001);
	if (x1+r1>w||y1+r1>h+eps||x2+r2 > w+eps || y2+r2 > h+eps) {
		cout << "impossible" << endl;
	}
	else {
		assert(x1 + r1 <= w + 0.0001);
		assert(x2 + r2 <= w + 0.0001);
		assert(y1 + r1 <= h + 0.0001);
		assert(y2 + r2 <= h + 0.0001);
		if (sw) {
			swap(x1, x2);
			swap(y1, y2);
			swap(r1, r2);
		}
		ld dist = sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
		assert(abs(dist - d) < eps);
		cout << x1 << " " << y1 << " " << r1 << " " << x2 << " " << y2 << " " << r2 << endl;
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(12);
	//init();
	//int t; cin >> t; rep(i, t)solve();
	while (cin >> w>>h>>a>>b>>ab, w|h|a|b|ab)solve();
	//solve();
	//stop
		return 0;
}

