#include <bits/stdc++.h>
#include <bits/extc++.h>

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using i128 = __int128;

#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

ostream &operator<<(ostream &os, i128 x) {
    string s;
    do {
        s.push_back(x % 10 + '0');
        x /= 10;
    } while (x);
    ranges::reverse(s);
    os << s;
    return os;
}

i128 gcd(i128 a, i128 b) {
    if (b == 0) {
        return a;
    }
    return gcd(b, a % b);
}

struct fact {
    i128 p, q;

    auto operator<=>(const fact &o) const { return p * o.q <=> q * o.p; }

    fact(i128 p = 0, i128 q = 1) : p(p), q(q) {
        update();
    }

    void update() {
        i128 g = gcd(p, q);
        p /= g;
        q /= g;
    }

    constexpr fact operator+(const fact &o) const { return fact(p * o.q + q * o.p, q * o.q); }

    constexpr fact operator-(const fact &o) const { return fact(p * o.q - q * o.p, q * o.q); }

    constexpr fact operator*(const fact &o) const { return fact(p * o.p, q * o.q); }

    constexpr fact operator/(const fact &o) const { return fact(p * o.q, q * o.p); }

    constexpr fact &operator+=(const fact &o) { return *this = *this + o; }

    constexpr fact &operator-=(const fact &o) { return *this = *this - o; }

    constexpr fact &operator*=(const fact &o) { return *this = *this * o; }

    constexpr fact &operator/=(const fact &o) { return *this = *this / o; }

    friend ostream &operator<<(ostream &os, const fact &o) {
        if (o < fact(1, 3)) {
            return os << "1/3";
        }
        return os << o.p << '/' << o.q;
    }
};

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> a(m + 1);
    for (int i = 1; i <= m; ++i) {
        cin >> a[i];
    }
    vector<vector<int>> oppo(n + 1);
    vector<int> mp(n + 1), gp(n + 1), cnt(n + 1);
    for (int i = 1; i <= m; ++i) {
        vector<bool> vis(n + 1);
        for (int j = 0; j < a[i]; ++j) {
            int p1, p2, w1, w2, d;
            cin >> p1 >> p2 >> w1 >> w2 >> d;
            vis[p1] = vis[p2] = true;
            gp[p1] += 3 * w1 + d;
            gp[p2] += 3 * w2 + d;
            if (w1 > w2) {
                mp[p1] += 3;
            } else if (w1 < w2) {
                mp[p2] += 3;
            } else {
                mp[p1] += 1;
                mp[p2] += 1;
            }
            oppo[p1].push_back(p2);
            oppo[p2].push_back(p1);
            cnt[p1] += 3 * (w1 + w2 + d);
            cnt[p2] += 3 * (w1 + w2 + d);
        }
        for (int i = 1; i <= n; ++i) {
            if (!vis[i]) {
                mp[i] += 3;
                gp[i] += 6;
                cnt[i] += 6;
            }
        }
        cout << "Round " << i << '\n';
        for (int j = 1; j <= n; ++j) {
            fact omw = 0, ogw = 0;
            for (auto x: oppo[j]) {
                omw += fact(max(i, mp[x]), 3 * i);
                ogw += fact(max(cnt[x] / 3, gp[x]), cnt[x]);
            }
            if (oppo[j].size()) omw /= oppo[j].size(), ogw /= oppo[j].size();
            cout << mp[j] << ' ' << omw << ' ' << fact(gp[j], cnt[j]) << ' ' << ogw << '\n';
        }
    }
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--)
        solve();
}