/*
Undo the destiny.
*/
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
#define ll long long
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define pii pair<int,int>
#define mp make_pair

char buf[1 << 20], *p1, *p2;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2)?EOF: *p1++)
template <typename T> inline void read(T &t) {
    int v = getchar();T f = 1;t = 0;
    while (!isdigit(v)) {if (v == '-')f = -1;v = getchar();}
    while (isdigit(v)) {t = t * 10 + v - 48;v = getchar();}
    t *= f;
}
template <typename T,typename... Args> inline void read(T &t,Args&... args) {
    read(t);read(args...);
}

const ll mod = 998244353;
const double eps = 1e-10;

void solve() {
    ll a,b,c,d,e,f,ppmax;
    read(ppmax,a,b,c,d,e,f);
    double fa = 300*a+300*b+200*c+100*d+50*e;
    double fb = 300 * (a+b+c+d+e+f);
    printf("%.2lf",fa*100/fb);putchar('%');
    fa = 320*a+300*b+200*c+100*d+50*e;
    fb = 320 * (a+b+c+d+e+f);
    fa /= fb;
    fa *= 5 * ppmax;
    fa -= 4 * ppmax;
    printf(" %.0lf\n",max(0.0,fa));
}

signed main() {
    int T;read(T);
    while (T--) solve();
    return 0; 
}