#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;
    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 = llround(acc * 10000) / 100.0;
    double cur_pp = 1.0 * (1.0 * 320 * a + 300 * b + 200 * c + 100 * d + 50 * e + 0 * f) / (320 * sum);
    // cout << cur_pp << endl;

    double pp = max((double)0, cur_pp - 0.8) * 5 * ppmax;
    // printf("%lf\n", pp * 10);
    // printf("%lld\n", llround(pp * 10));
    // cout << (LL)(pp * 10) % 10ll << endl;
    printf("%.2lf", acc);
    cout << "% ";
    LL ans = (LL)pp;

    if ((llround(pp * 10)) % 10 >= 5)
        ans++;
    printf("%lld\n", ans);
}

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