#include <bits/stdc++.h>
using namespace std;

bool Memory_begin;

/*

*/
template <int mod>
unsigned int down(unsigned int x)
{
    return x >= mod ? x - mod : x;
}
template <int mod>
struct Modint
{
    unsigned int x;
    Modint() = default;
    Modint(unsigned int x) : x(x) {}
    friend istream &operator>>(istream &in, Modint &a) { return in >> a.x; }
    friend ostream &operator<<(ostream &out, Modint a) { return out << a.x; }
    friend Modint operator+(Modint a, Modint b) { return down<mod>(a.x + b.x); }
    friend Modint operator-(Modint a, Modint b) { return down<mod>(a.x - b.x + mod); }
    friend Modint operator*(Modint a, Modint b) { return 1ULL * a.x * b.x % mod; }
    friend Modint operator/(Modint a, Modint b) { return a * ~b; }
    friend Modint operator^(Modint a, int b)
    {
        Modint ans = 1;
        for (; b; b >>= 1, a *= a)
            if (b & 1)
                ans *= a;
        return ans;
    }
    friend Modint operator~(Modint a) { return a ^ (mod - 2); }
    friend Modint operator-(Modint a) { return down<mod>(mod - a.x); }
    friend Modint &operator+=(Modint &a, Modint b) { return a = a + b; }
    friend Modint &operator-=(Modint &a, Modint b) { return a = a - b; }
    friend Modint &operator*=(Modint &a, Modint b) { return a = a * b; }
    friend Modint &operator/=(Modint &a, Modint b) { return a = a / b; }
    friend Modint &operator^=(Modint &a, int b) { return a = a ^ b; }
    friend Modint &operator++(Modint &a) { return a += 1; }
    friend Modint operator++(Modint &a, int)
    {
        Modint x = a;
        a += 1;
        return x;
    }
    friend Modint &operator--(Modint &a) { return a -= 1; }
    friend Modint operator--(Modint &a, int)
    {
        Modint x = a;
        a -= 1;
        return x;
    }
    friend bool operator==(Modint a, Modint b) { return a.x == b.x; }
    friend bool operator!=(Modint a, Modint b) { return !(a == b); }
};
const int mod = 1e9 + 7;
typedef Modint<mod> mint;

mint binom(long long x, int y)
{
    if (x < y or x < 0 or y < 0)
        return mint(0);
    mint res = 1;
    for (long long i = x - y + 1; i <= x; i++)
        res *= (i % mod);
    for (int i = 1; i <= y; i++)
        res /= i;
    return res;
}

bool Memory_end;

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cerr << (&Memory_end - &Memory_begin) / 1048576.0 << "MB" << '\n';

    int t;
    cin >> t;
    while (t--)
    {
        double ppmax, a, b, c, d, e, f;
        cin >> ppmax >> a >> b >> c >> d >> e >> f;
        double acc = (a * 300 + b * 300 + c * 200 + d * 100 + e * 50) / (a + b + c + d + e + f);
        acc /= 3.0;
        cout << fixed << setprecision(2) << acc << "% ";
        acc = (a * 320 + b * 300 + c * 200 + d * 100 + e * 50) / (a + b + c + d + e + f);
        acc *= 5.0 * ppmax;
        acc /= 320;
        acc -= 4.0 * ppmax;
        double pp = max(0.0, acc);
        cout << fixed << setprecision(0) << pp << '\n';
    }
}
/*
2
630
3029 2336 377 41 10 61
3000
20000 10000 0 0 0 0
*/