#include <iostream>
#include <cstring>
#include <queue>
#include <map>
#include <cstdio>
#include <unordered_map>
#include <deque>
#include <iomanip>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stack>
#include <set>
#include <array>
#include <bitset>
#include <limits.h>
#include <numeric>
#define x first
#define y second

using namespace std;
typedef  long long LL;
typedef long long ll  ; 
typedef pair<int,int> PII;
typedef pair<int,LL> PIL;
typedef pair<int ,PII> PIII ;
typedef pair<int, pair<PII ,int > > PIIII;
typedef pair<LL , LL> PLL ; 
typedef pair<LL ,int > PLI ;
typedef pair<int,char > PIC ; 
typedef unsigned long long ULL ;
 
const int N = 5e5+10,M = 4e5+10  ;
const LL mod = 1e9+7 , INF = 1e18+10;
const int inf =  1e8 ; 
const double eps = 1e-7 ;
const ULL  P=  131 ;
LL n , m  , k   ;



void solve( ) {
	int ppmx ; 
	scanf("%d" , &ppmx ) ;
	int a , b , c, d,  e ,f ; 
	scanf("%d%d%d%d%d%d", &a , &b , &c , &d , &e ,&f ) ;
	int sum = ( a + b ) * 300 + c *200 + d * 100 + e * 50 ;
	int all = ( a + b + c + d + e + f ) * 300 ;
	printf("%0.2lf" , (double)sum/all*100   ) ;
	sum = a * 320 + b * 300 + c *200 + d * 100 + e * 50 ; 
	all = ( a + b + c + d + e + f ) * 320 ;
	double score = max( 0.0 , double( sum) / all - 0.8 ) * 5 * ppmx ;
	printf("%% ") ;
	// cout << score + 0.5<< '\n';
	printf("%d\n" ,(int)( score + 0.500000001) ) ;
	
} 	
 
 
 
int main(){ 	
	// ios::sync_with_stdio(false);
	// cin.tie( 0 ) ; cout.tie(0) ;
	int T = 1 ;
	// cin >> T ;
	scanf("%d",&T) ; 
	while(T-- ){	
		solve() ;  
   	}        
 	return  0 ;
}