Problem: Following FIFA World Cup, a larger competition called ``GIGA Universe Cup'' is taking place somewhere in our universe. Both FIFA World Cup and GIGA Universe Cup are two rounds competitions that consist of the first round, also known as ``group league,'' and the second called ``final tournament.'' In the first round, participating teams are divided into groups of four teams each. Each team in a group plays a match against each of the other teams in the same group. For example, let's say we have a group of the following four teams, ``Engband, Swedon, Argontina, and Nigerua.'' They play the following six matches: Engband - Swedon, Engband - Argontina, Engband - Nigerua, Swedon - Argontina, Swedon - Nigerua, and Argontina - Nigerua.

The result of a single match is shown by the number of goals scored by each team, like ``Engband 1 - 0 Argontina,'' which says Engband scored one goal whereas Argontina zero. Based on the result of a match, points are given to the two teams as follows and used to rank teams. If a team wins a match (i.e., scores more goals than the other), three points are given to it and zero to the other. If a match draws (i.e., the two teams score the same number of goals), one point is given to each.

The goal difference of a team in given matches is the total number of goals it scored minus the total number of goals its opponents scored in these matches. For example, if we have three matches ``Swedon 1 - 2 Engband,'' ``Swedon 3 - 4 Nigerua,'' and ``Swedon 5 - 6 Argontina,'' then the goal difference of Swedon in these three matches is (1 + 3 + 5) - (2 + 4+ 6) = -3.

Given the results of all the six matches in a group, teams are ranked by the following criteria, listed in the order of priority (that is, we first apply (a) to determine the ranking, with ties broken by (b), with ties broken by (c), and so on).

(a) greater number of points in all the group matches;

(b) greater goal difference in all the group matches;

(c) greater number of goals scored in all the group matches.

If two or more teams are equal on the basis of the above three criteria, their place shall be determined by the following criteria, applied in this order:

(d) greater number of points obtained in the group matches between the teams concerned;

(e) greater goal difference resulting from the group matches between the teams concerned;

(f) greater number of goals scored in the group matches between the teams concerned;

If two or more teams are stiIl equal, apply (d), (e), and (f) as necessary to each such group. Repeat this until those three rules to equal teams do not make any further resolution. Finally, teams that still remain equal are ordered by:

(g) drawing lots by the Organizing Committee for the GIGA Universe Cup.

The two teams coming first and second in each group qualify for the second round.

Your job is to write a program which, given the results of matches played so far in a group and one team specified in the group, calculates the probability that the specified team will qualify for the second round. You may assume each team has played exactly two matches and has one match to play. In total, four matches have been played and two matches are to be played.

Assume the probability that any team scores (exactly) p goals in any match is:

<image>

for p ≤ 8, and zero for p > 8 . Assume the lot in the step (g) is fair.



Input

The first line of the input is an integer, less than 1000, that indicates the number of subsequent records.

The rest of the input is the indicated number of records. A single record has the following format:

<image>

In the above, <_> is a single underscore (_) and <empty> a sequence of exactly four underscores (____). Each of <team>1, ... , <team>4 is either an asterisk character (*) followed by exactly three uppercase letters (e.g., *ENG), or an underscore followed by exactly three uppercase letters (e.g., _SWE). The former indicates that it is the team you are asked to calculate the probability of the second round qualification for. You may assume exactly one of <team>1, ... , <team>4 is marked with an asterisk. Each <m>ij(1 ≤ i < j ≤ 4) is a match result between the <team>i and <team>j. Each match result is either __-_ (i.e., two underscores, hyphen, and another underscore) or of the form _x-y where each of x and y is a single digit (≤ 8) . The former indicates that the corresponding match has not been played, whereas the latter that the result of the match was x goals by <team>i and y goals by <team>j. Since each team has played exactly two matches, exactly two match results are in the former format.

Output

The output should consist of n lines where n is the number of records in the input. The ith line should show the probability that the designated team (marked with an asterisk) will qualify for the second round in the ith record.

Numbers should be printed with exactly seven digits after the decimal point. Each number should not contain an error greater than 10-7.

Example

Input

5
_____*AAA__BBB__CCC__DDD
*AAA_______0-0__0-0___-_
_BBB_____________-___0-0
_CCC_________________0-0
_DDD____________________
______CHN__CRC__TUR_*BRA
_CHN_______0-2___-___0-4
_CRC____________1-1___-_
_TUR_________________1-2
*BRA____________________
______CMR_*KSA__GER__IRL
_CMR_______1-0___-___1-1
*KSA____________0-8___-_
_GER_________________1-1
_IRL____________________
______TUN__JPN_*BEL__RUS
_TUN________-___1-1__0-2
_JPN____________2-2__1-0
*BEL__________________-_
_RUS____________________
______MEX__CRO_*ECU__ITA
_MEX_______1-0__2-1___-_
_CRO_____________-___2-1
*ECU_________________0-2
_ITA____________________


Output

0.5000000
1.0000000
0.0000000
0.3852746
0.0353304

Solution (in CPP):

Solution:
#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<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
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++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-4;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
struct result {
	int x, y, cx, cy;
};
result a[6];
int target;
int c[4];
void a_calc() {
	rep(i, 4) {
		c[i] = 0;
	}
	rep(i, 6) {
		if (a[i].cx > a[i].cy)c[a[i].x] += 3;
		else if (a[i].cx < a[i].cy)c[a[i].y] += 3;
		else {
			c[a[i].x]++; c[a[i].y]++;
		}
	}
}
void b_calc() {
	rep(i, 4) {
		c[i] = 0;
	}
	rep(i, 6) {
		c[a[i].x] += a[i].cx - a[i].cy;
		c[a[i].y] += a[i].cy - a[i].cx;
	}
}
void c_calc() {
	rep(i, 4) {
		c[i] = 0;
	}
	rep(i, 6) {
		c[a[i].x] += a[i].cx;
		c[a[i].y] += a[i].cy;
	}
}
void d_calc(vector<int> v) {
	rep(i, 4) {
		c[i] = 0;
	}
	int exi[4] = {};
	rep(i, v.size()) {
		exi[v[i]] = 1;
	}
	rep(i, 6) {
		if (!exi[a[i].x] || !exi[a[i].y])continue;
		if (a[i].cx > a[i].cy)c[a[i].x] += 3;
		else if (a[i].cx < a[i].cy)c[a[i].y] += 3;
		else {
			c[a[i].x]++; c[a[i].y]++;
		}
	}
}
void e_calc(vector<int> v) {
	rep(i, 4) {
		c[i] = 0;
	}
	int exi[4] = {};
	rep(i, v.size()) {
		exi[v[i]] = 1;
	}
	rep(i, 6) {
		if (!exi[a[i].x] || !exi[a[i].y])continue;
		c[a[i].x] += a[i].cx - a[i].cy;
		c[a[i].y] += a[i].cy - a[i].cx;
	}
}
void f_calc(vector<int> v) {
	rep(i, 4) {
		c[i] = 0;
	}
	int exi[4] = {};
	rep(i, v.size()) {
		exi[v[i]] = 1;
	}
	rep(i, 6) {
		if (!exi[a[i].x] || !exi[a[i].y])continue;
		c[a[i].x] += a[i].cx;
		c[a[i].y] += a[i].cy;
	}
}
vector<int> a_rule(vector<int> u) {
	vector<int> res;
	a_calc();
	vector<P> v;
	rep(i, u.size()) {
		v.push_back({ c[u[i]],u[i] });
	}
	sort(v.begin(), v.end(),greater<P>());
	int cnt = 0;
	rep(i, v.size()) {
		res.push_back(v[i].second);
		while (i + 1 < v.size() && v[i].first == v[i + 1].first) {
			i++; res.push_back(v[i].second);
		}
		cnt++;
		if (cnt == 1)break;
	}
	sort(res.begin(), res.end()); return res;
}
vector<int> b_rule(vector<int> v) {
	vector<int> res;
	b_calc();
	vector<P> u;
	rep(i, v.size()) {
		u.push_back({ c[v[i]],v[i] });
	}
	sort(u.begin(), u.end(), greater<P>());
	int cnt = 0;
	rep(i, u.size()) {
		res.push_back(u[i].second);
		while (i + 1 < u.size() && u[i].first == u[i + 1].first) {
			i++; res.push_back(u[i].second);
		}
		cnt++; if (cnt == 1)break;
	}
	sort(res.begin(), res.end()); return res;
}
vector<int> c_rule(vector<int> v) {
	vector<int> res; c_calc();
	vector<P> u;
	rep(i, v.size()) {
		u.push_back({ c[v[i]],v[i] });
	}
	sort(u.begin(), u.end(), greater<P>());
	int cnt = 0;
	rep(i, u.size()) {
		res.push_back(u[i].second);
		while (i + 1 < u.size() && u[i].first == u[i + 1].first) {
			i++; res.push_back(u[i].second);
		}
		cnt++; if (cnt == 1)break;
	}
	sort(res.begin(), res.end()); return res;
}
vector<int> d_rule(vector<int> v) {
	vector<int> res; d_calc(v);
	vector<P> u;
	rep(i, v.size()) {
		u.push_back({ c[v[i]],v[i] });
	}
	sort(u.begin(), u.end(), greater<P>());
	int cnt = 0;
	rep(i, u.size()) {
		res.push_back(u[i].second);
		while (i + 1 < u.size() && u[i].first == u[i + 1].first) {
			i++; res.push_back(u[i].second);
		}
		cnt++; if (cnt == 1)break;
	}
	sort(res.begin(), res.end()); return res;
}
vector<int> e_rule(vector<int> v) {
	vector<int> res; e_calc(v);
	vector<P> u;
	rep(i, v.size()) {
		u.push_back({ c[v[i]],v[i] });
	}
	sort(u.begin(), u.end(), greater<P>());
	int cnt = 0;
	rep(i, u.size()) {
		res.push_back(u[i].second);
		while (i + 1 < u.size() && u[i].first == u[i + 1].first) {
			i++; res.push_back(u[i].second);
		}
		cnt++; if (cnt == 1)break;
	}
	sort(res.begin(), res.end()); return res;
}
vector<int> f_rule(vector<int> v) {
	vector<int> res; f_calc(v);
	vector<P> u;
	rep(i, v.size()) {
		u.push_back({ c[v[i]],v[i] });
	}
	sort(u.begin(), u.end(), greater<P>());
	int cnt = 0;
	rep(i, u.size()) {
		res.push_back(u[i].second);
		while (i + 1 < u.size() && u[i].first == u[i + 1].first) {
			i++; res.push_back(u[i].second);
		}
		cnt++; if (cnt == 1)break;
	}
	sort(res.begin(), res.end()); return res;
}
ld ret() {
	bool one = false;
	vector<int> v = { 0,1,2,3 }; vector<int> cop;
	cop = v; v = a_rule(v);
	if (v.size() == 1 && !one) {
		one = true;
		if (v[0] == target)return 1;
		vector<int> cv;
		rep(i, cop.size()) {
			if (v[0] == cop[i])continue;
			cv.push_back(cop[i]);
		}
		v = cv;
		v = a_rule(v);
	}
	if (v.size() == 1) {
		if (v[0] == target)return 1;
		else return 0;
	}
	cop = v; v = b_rule(v);
	if (v.size() == 1 && !one) {
		one = true;
		if (v[0] == target)return 1;
		vector<int> cv;
		rep(i, cop.size()) {
			if (v[0] == cop[i])continue;
			cv.push_back(cop[i]);
		}
		v = cv;
		v = b_rule(v);
	}
	if (v.size() == 1) {
		if (v[0] == target)return 1;
		else return 0;
	}
	cop = v; v = c_rule(v);
	if (v.size() == 1 && !one) {
		one = true;
		if (v[0] == target)return 1;
		vector<int> cv;
		rep(i, cop.size()) {
			if (v[0] == cop[i])continue;
			cv.push_back(cop[i]);
		}
		v = cv;
		v = c_rule(v);
	}
	if (v.size() == 1) {
		if (v[0] == target)return 1;
		else return 0;
	}
	cop = v;
		v = d_rule(v);
	if (v.size() == 1 && !one) {
		one = true;
		if (v[0] == target)return 1;
		vector<int> cv;
		rep(i, cop.size()) {
			if (v[0] == cop[i])continue;
			cv.push_back(cop[i]);
		}
		v = cv;
			v = d_rule(v);
	}
	if (v.size() == 1) {
		if (v[0] == target)return 1;
		else return 0;
	}cop = v;
		v = e_rule(v);
	if (v.size() == 1 && !one) {
		one = true;
		if (v[0] == target)return 1;
		vector<int> cv;
		rep(i, cop.size()) {
			if (v[0] == i)continue;
			cv.push_back(cop[i]);
		}
		v = cv;
			v = e_rule(v);
	}
	if (v.size() == 1) {
		if (v[0] == target)return 1;
		else return 0;
	}cop = v;
		v = f_rule(v);
	if (v.size() == 1 && !one) {
		one = true;
		if (v[0] == target)return 1;
		vector<int> cv;
		rep(i, cop.size()) {
			if (v[0] == cop[i])continue;
			cv.push_back(cop[i]);
		}
		v = cv;
			v =f_rule(v);
	}
	if (v.size() == 1) {
		if (v[0] == target)return 1;
		else return 0;
	}cop = v;
		v = d_rule(v);
	if (v.size() == 1 && !one) {
		one = true;
		if (v[0] == target)return 1;
		vector<int> cv;
		rep(i, cop.size()) {
			if (v[0] == cop[i])continue;
			cv.push_back(cop[i]);
		}
		v = cv;
			v = d_rule(v);
	}
	if (v.size() == 1) {
		if (v[0] == target)return 1;
		else return 0;
	}cop = v;
		v = e_rule(v);
	if (v.size() == 1 && !one) {
		one = true;
		if (v[0] == target)return 1;
		vector<int> cv;
		rep(i, cop.size()) {
			if (v[0] == i)continue;
			cv.push_back(cop[i]);
		}
		v = cv;
		v = e_rule(v);
	}
	if (v.size() == 1) {
		if (v[0] == target)return 1;
		else return 0;
	}cop = v;
		v = f_rule(v);
	if (v.size() == 1 && !one) {
		one = true;
		if (v[0] == target)return 1;
		vector<int> cv;
		rep(i, cop.size()) {
			if (v[0] == cop[i])continue;
			cv.push_back(cop[i]);
		}
		v = cv;
			v = f_rule(v);
	}
	if (v.size() == 1) {
		if (v[0] == target)return 1;
		else return 0;
	}cop = v;
		v = d_rule(v);
	if (v.size() == 1 && !one) {
		one = true;
		if (v[0] == target)return 1;
		vector<int> cv;
		rep(i, cop.size()) {
			if (v[0] == cop[i])continue;
			cv.push_back(cop[i]);
		}
		v = cv;
			v = d_rule(v);
	}
	if (v.size() == 1) {
		if (v[0] == target)return 1;
		else return 0;
	}cop = v;
		v = e_rule(v);
	if (v.size() == 1 && !one) {
		one = true;
		if (v[0] == target)return 1;
		vector<int> cv;
		rep(i, cop.size()) {
			if (v[0] == i)continue;
			cv.push_back(cop[i]);
		}
		v = cv;
			v = e_rule(v);
	}
	if (v.size() == 1) {
		if (v[0] == target)return 1;
		else return 0;
	}cop = v;
		v = f_rule(v);
	if (v.size() == 1 && !one) {
		one = true;
		if (v[0] == target)return 1;
		vector<int> cv;
		rep(i, cop.size()) {
			if (v[0] == cop[i])continue;
			cv.push_back(cop[i]);
		}
		v = cv;
			v = f_rule(v);
	}
	if (v.size() == 1) {
		if (v[0] == target)return 1;
		else return 0;
	}
	if (!one) {
		rep(i, v.size()) {
			if (v[i] == target) {
				return 2 / (ld)v.size();
			}
		}
		return 0;
	}
	else {
		rep(i, v.size()) {
			if (v[i] == target) {
				return 1 / (ld)v.size();
			}
		}
		return 0;
	}
}
ld pos[9];
ld pp[9];
void init() {
	pp[0] = 1;
	rep1(i, 8) {
		pp[i] = pp[i - 1] * i;
	}
	rep(i, 9) {
		pos[i] = pp[8] / (pp[i] * pp[8 - i]);
		rep(j, i) {
			pos[i] *= 0.25;
		}
		rep(j, 8 - i) {
			pos[i] *= 0.75;
		}
		//cout << pos[i] << endl;
	}
}
P check[6] = { {1,11},{1,16},{1,21},{2,16},{2,21},{3,21} };
P loc[6] = { {0,1},{0,2},{0,3},{1,2},{1,3},{2,3} };
int main() {
	init();
	cout << fixed << setprecision(8);
	int n; cin >> n;
	rep(aa, n) {
		string s[5];
		rep(i, 5) {
			cin >> s[i];
			if (s[i][0] == '*')target = i-1;
		}
		ld out = 0;
		//int num = 0, hie = 0;
		rep(p1, 9) {
			rep(p2, 9) {
				rep(p3, 9) {
					rep(p4, 9) {
						int now = 0; int cnow = 0;
						rep(i, 6) {
							int x = check[i].first; int y = check[i].second;
							if (s[x][y] == '_') {
								if (cnow == 0) {
									a[i] = { loc[i].first,loc[i].second,p1,p2 }; cnow++;
								}
								else {
									a[i] = { loc[i].first,loc[i].second,p3,p4 };
								}
							}
							else {
								a[i] = { loc[i].first,loc[i].second,s[x][y] - '0',s[x][y + 2] - '0' };
							}
						}
						out += pos[p1] * pos[p2] * pos[p3] * pos[p4] * ret();
						//if (ret() == 1)num++;
						//if (ret() == 0)hie++;
					}
				}
			}
		}
		cout << out << endl;
		//cout << num << " " << hie << endl;
	}
	return 0;
}