#include<bits/stdc++.h>
#define test(i) cout << #i << " "<< i << " " << endl;
#define endl '\n'

using namespace std;
typedef long long ll;

const int INF=0x3f3f3f3f;
const int N=2e5+5;

ll t,n;

void fio(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

void print(double a1,ll a2){
	a1*=100;
	printf("%.2lf",a1);
	cout << "%" << " ";
	printf("%lld",a2);
	cout << endl;
}

void solve(){
	double pp;
	cin >> pp;
	long double a[10],b[]={300,300,200,100,50,0};
	ll c[]={320,300,200,100,50,0};
	for(int i=0; i<6; i++){
		cin >> a[i];
	}
	double ans1=0;
	ll ans2=0;
	double tmp=0;
	for(int i=0; i<6; i++){
		ans1+=a[i]*b[i];
		tmp+=a[i];
	}
	ans1/=tmp*300;
	for(int i=0; i<6; i++){
		ans2+=a[i]*c[i];
	}
	ans2-=256*tmp;
	ans2=ans2*5*pp;
	if(ans2<0) print(ans1,0);
	else{
		ll tt=ans2;
		tt/=320*tmp;
		ll t1=tt,t2=tt+1;
		if(llabs(t1*320*tmp-ans2)>=llabs(t2*320*tmp-ans2)) print(ans1,t2);
		else print(ans1,t1);
	}
	
}

signed main()
{
	//fio();
	cin >> t;
	//t=1;
	while(t--){
		solve();
	}
	return 0;
}