#include <iostream>
#include <map>
#include <set>
#include <array>
#include <cmath>
#include <queue>
#include <stack>
#include <bitset>
#include <random> //mt19937 mtrand(time(0));
#include <string>
#include <time.h>
#include <vector>
#include <cstring>
#include <iomanip> //fixed<<setprecision(12)<<
#include <utility> //pair模板,std::move()
#include <assert.h>
#include <algorithm>
#include <unordered_map>
#define QAQ 0
#define endl '\n'
#define close                         \
    std::ios::sync_with_stdio(false); \
    cin.tie(0);                       \
    cout.tie(0)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
const db pi = acos(-1);
const db eps = 1e-7;
const int inf = 1e9;
const ll INF = 2e18;
const int N = 1e6 + 7;
const int M = 5e6 + 7;
const int mod = 998244353;
const int base = 131;
using namespace std;
//

int ppmax, a, b, c, d, e, f;

ll gcd(ll a, ll b)
{
    return b == 0 ? a : gcd(b, a % b);
}

void solve()
{
    //	freopen("data.in.txt","r",stdin);
    //	freopen("data.out.txt","w",stdout);
    cin >> ppmax >> a >> b >> c >> d >> e >> f;
    double acc = (300.0 * a + 300.0 * b + 200 * c + 100 * d + 50 * e) / (300.0 * (a + b + c + d + e + f));
    printf("%.2f%% ", acc * 100);
    ll up = 320ll * a + 300 * b + 200 * c + 100 * d + 50 * e;
    ll dn = 320 * (a + b + c + d + e + f);
    up = up * 5 - dn * 4;
    dn *= 5;
    if (up <= 0)
        cout << 0 << "\n";
    else
    {
        ll gd = gcd(up, dn);
        up /= gd;
        dn /= gd;
        up *= 5ll * ppmax;
        ll ans = up / dn;
        up %= dn;
        if (up * 2 >= dn)
            ans++;
        cout << ans << "\n";
    }
}

signed main()
{
    // close;
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return QAQ;
}