#include<bits/stdc++.h>
#define endl '\n'
#define ll  long long
#define Int __int128
#define pb push_back
#define eb emplace_back
#define MAX_LOG 21
#define ff first
#define ss second
#define M (int)1e4+10
#define ull unsigned long long
#define MAX_LOG 21
//#define double long double
using namespace std;
const double PI=3.1415926535897932385;
const int IIMIN=-2147483648;
//const ll p=998244353;
const ll mod=1e9+7;
const int INF=0x3f3f3f3f;
typedef pair<ll,ll> PLL;
typedef pair<double,double>PFF;
ll gcd(ll a,ll b)
{
    if(b) while((a%=b)&&(b%=a));
    return a+b;
}//最大公约数函数
ll spid(ll a,ll b,ll p)
{
    ll ans=1;
    while(b)
    {
        if(b&1)ans=ans*a%p;
        b>>=1;
        a=a*a%p;
    }
    return ans;
}//快速幂函数
///小香猪的代码块·香香猪猪惹人怜~
///秋雨想睡觉
const ll N =4e5+10;
void solve()
{
    ll ppmax;cin>>ppmax;
    ll a,b,c,d,e,f;cin>>a>>b>>c>>d>>e>>f;
    double ans1=300*a+300*b+200*c+100*d+50*e;
    ans1=ans1/(300*(a+b+c+d+e+f))*100;
    cout<<fixed<<setprecision(2)<<ans1<<'%'<<' ';
    double res1=320*a+300*b+200*c+100*d+50*e-8*32*((a+b+c+d+e+f));
    res1/=320*(a+b+c+d+e+f);
    double pp=max(0.0,res1)*5*ppmax;
    ll ans2=pp;
    if(pp-ans2>=0.5)ans2++;
    cout<<ans2<<'\n';
}
//2
//630
//3029 2336 377 41 10 61
//3000
//20000 10000 0 0 0 0
///秋雨睡觉了
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t=1;
    cin>>t;
    while(t--)
    {
        solve();
    }
}
///记忆是梦的开场白
/*
  */