#include<bits/stdc++.h>
#define lowbit(x) (x & (-x))
#define endl "\n"
#define ll long long
#define int long long
// #define ull unsigned long long
#define fi first
#define se second
using namespace std;
#define pii pair<int, int>
#define rep(i, a, b) for(int i = a; i <= b; i ++ )
#define pre(i, a, b) for(int i = a; i >= b; i -- )
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
mt19937_64 rnd(time(0));
const int N = 1e6 + 10;
long double a,b,c,d,e,f,n,m;

double zhuan(double x){

    x*=10000;
    x+=0.5;
    // printf("%.18lf+++\n",x);
    int now=x;
    // printf("%lld++++\n",now);
    double ans=1.0*now/10000;
    // printf("%.18lf+++\n",ans);
    return ans;

}

// double zhuan2(double x){}
void solve()
{
    scanf("%Lf%Lf%Lf%Lf%Lf%Lf%Lf", &n, &a, &b, &c, &d, &e, &f);
    double ans = (300.0 * a + 300.0 * b + 200.0 * c + 100.0 * d + 50.0 * e) / (300.0 * (a + b + c + d + e + f));
    double res = (5.0 * n * (320.0 * a + 300.0 * b + 200.0 * c + 100.0 * d + 50.0 * e) / (320.0 * (a + b + c + d + e + f)) - 0.8 * n * 5.0);
    res = max(res, 0.0);
    
    res=zhuan(res);
    
    ans=zhuan(ans);
    
    ans *= 100.0;
    
    printf("%.2lf", ans);
    printf("%%");
    printf(" ");
    printf("%.0lf\n", res);


}
signed main()
{
    // IOS;
    int _;
    _ = 1;
    // cin >> _;
    scanf("%lld", &_);
    while(_ -- )
    {
        solve();
    }
	return 0;
}