#include <iostream>
#include <algorithm>
#include <map>
#include <cstring>
#include <string>
#include <vector>
#include <cctype>
#include <cmath>
#include <queue>
#include <set>
#include <functional>
#include <unordered_map>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PLL;
#define qwq ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define tcase      \
    LL t = read(); \
    while (t--)

LL read()
{
    LL sum = 0, fl = 1;
    int ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        if (ch == '-')
            fl = -1;
    for (; isdigit(ch); ch = getchar())
        sum = sum * 10 + ch - '0';
    return sum * fl;
}
// #define long double double
void solve()
{
    // 0..9342
    LL ppmax = read();
    LL a = read(), b = read(), c = read(), d = read(), e = read(), f = read();
    LL sum = a + b + c + d + e + f;
    // cout << sum << endl;
    long double acc = 1.0 * (300 * a + 300 * b + 200 * c + 100 * d + 50 * e + 0 * f) / (300 * sum);
    // cout << acc << endl;
    // cout << "tmp " << (300 * a + 300 * b + 200 * c + 100 * d + 50 * e + 0 * f) << endl;
    acc = llroundl(acc * 10000) / 100.0;
    // cout << cur_pp << endl;
    long double pp = 0;
    if (10 * (320 * a + 300 * b + 200 * c + 100 * d + 50 * e + 0 * f) > 8 * (320 * sum))
        pp = (1.0 * (320 * a + 300 * b + 200 * c + 100 * d + 50 * e + 0 * f) * 5 * ppmax - 8 * 5 * ppmax * 32 * sum) / (320 * sum);
    // cout << (LL)(pp * 10000) << endl;
    // auto myround = [&](long double val)
    // {
    //     LL down = val;
    //     LL up = down + 1;
    //     printf("%LF %LF\n", val - (long double)down, (long double)up - val);
    //     if (val - (long double)down < (long double)up - val)
    //         return down;
    //     return up;
    // };
    // printf("%Lf\n", pp * 1000000);
    // cout << (LL)(pp * 10) % 10 << endl;
    printf("%.2Lf", acc);
    cout << "% ";
    // cout << pp << endl;
    printf("%lld\n", llroundl(pp));
}

int main()
{
    tcase
    solve();
    return 0;
}