#define _CRT_SECURE_NO_WARNINGS
#define _SILENCE_CXX17_C_HEADER_DEPRECATION_WARNING
#include <bits/stdc++.h>
using namespace std;
#define CRP(t, x) const t &x
#define OPX(op, t, x) operator op(CRP(t, x))
#define OPL(t, x) bool OPX(<, t, x) const
#define FIL(x, v) memset(x, v, sizeof(x))
#define CLR(x) FIL(x, 0)
#define NE1(x) FIL(x, -1)
#define INF(x) FIL(x, 0x3f)
#ifndef _DEBUG
#define _DEBUG 0
#endif // !_DEBUG
#define IFD if (_DEBUG)
typedef int64_t ll, i64;
typedef uint64_t ull, u64;
template <typename... Types>
using comtype = typename common_type<Types...>::type;
template <typename T>
using enable_if_arithmetic = typename enable_if<is_arithmetic<T>::value>::type;
template <typename T>
using enable_if_integral = typename enable_if<is_integral<T>::value>::type;
inline char getchar(int)
{
    static char buf[64 << 20], *S = buf, *T = buf;
    if (S == T) T = fread(S = buf, 1, 64 << 20, stdin) + buf;
    return S == T ? EOF : *S++;
}
template <typename T, typename = enable_if_integral<T>>
inline bool read(T &x)
{
    int ch = x = 0, f = 1;
    while (!isdigit(ch = getchar()))
        if (ch == EOF)
            return false;
        else if (ch == '-')
            f = 0;
    for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
    return x = f ? x : -x, true;
}
template <typename T, typename... Args, typename = enable_if_integral<T>>
inline bool read(T &x, Args &... args) { return read(x) && read(args...); }
template <typename T1, typename T2, typename TResult = comtype<T1, T2>>
inline TResult mmin(CRP(T1, v1), CRP(T2, v2)) { return min<TResult>(v1, v2); }
template <typename T, typename... Args, typename TResult = comtype<T, Args...>>
inline TResult mmin(CRP(T, v), const Args &... args) { return min<TResult>(v, mmin(args...)); }
template <typename T1, typename T2, typename TResult = comtype<T1, T2>>
inline TResult mmax(CRP(T1, v1), CRP(T2, v2)) { return max<TResult>(v1, v2); }
template <typename T, typename... Args, typename TResult = comtype<T, Args...>>
inline TResult mmax(CRP(T, v), const Args &... args) { return max<TResult>(v, mmax(args...)); }
inline ll gcd(ll a, ll b)
{
    for (; b; swap(a, b)) a %= b;
    return a;
}
inline ll fpow(ll a, ll b, ll m)
{
    ll r = 1;
    for (; b; b >>= 1, a = a * a % m)
        if (b & 1) r = r * a % m;
    return r;
}
constexpr double eps = 1e-8;
inline int sgn(double x) { return x > eps ? 1 : x < -eps ? -1 : 0; }
struct item
{
    ll a, b, c, d, v;
    void calc()
    {
        v = 1000000 * (a + b + c + d) +
            10000 * (a * b + a * c + a * d + b * c + b * d + c * d) +
            100 * (a * b * c + a * b * d + a * c * d + b * c * d) +
            (a * b * c * d);
    }
    OPL(item, rhs)
    {
        return v > rhs.v;
    }
};
vector<item> v[51];
bool ok=1;
struct dfsitm{
    ll a,b,c,d;
    bool operator < (const dfsitm& r)const{
        if(a!=r.a)return a<r.a;
        else if(b!=r.b)return b<r.b;
        else if(c!=r.c)return c<r.c;
        else if(d!=r.d)return d<r.d;
        else return false;
    }
};
set<dfsitm> st[51];
int itcnt=0;
ll sum[] = {100, 100, 100, 100};
ll ansans=0;
void dfs(int tim){
    if(tim>itcnt)ansans=max(ansans,sum[0] * sum[1] * sum[2] * sum[3]);
    else{
        for(auto x:st[tim]){
            sum[0]+=x.a,sum[1]+=x.b,sum[2]+=x.c,sum[3]+=x.d;
            dfs(tim+1);
            sum[0]-=x.a,sum[1]-=x.b,sum[2]-=x.c,sum[3]-=x.d;
        }
    }
}
int main()
{
    int T, n, k;
    read(T);
    while (T--)
    {
        read(n, k);
        itcnt=0;ok=1;
        for (int i = 1; i <= k; i++) v[i].clear();
        item x;
        for (int i = 0, t; i < n; i++)
        {
            read(t, x.a, x.b, x.c, x.d);
            x.calc();
            v[t].push_back(x);
        }
        for (int i = 1; i <= k; i++) sort(v[i].begin(), v[i].end());
        sum[0]=sum[1]=sum[2]=sum[3]=100;
        for (int i = 1; i <= k; i++){
            if (!v[i].empty())
            {    
                ll mx=v[i].front().v;
                for(int j=v[i].size()-1;j>0;j--)if(v[i][j].v<mx)v[i].pop_back();
                if(v[i].size()==1){
//                    cout<<"gua"<<endl;
                    sum[0] += v[i].front().a;
                    sum[1] += v[i].front().b;
                    sum[2] += v[i].front().c;
                    sum[3] += v[i].front().d;
                }else{
                    itcnt++;ok=0;
                    for(int j=0;j<v[i].size();j++)
                        st[itcnt].insert(dfsitm{v[i][j].a,v[i][j].b,v[i][j].c,v[i][j].d});
                }
            }
        }
        if(!ok){
            for(auto x:st[1]){
                sum[0]+=x.a,sum[1]+=x.b,sum[2]+=x.c,sum[3]+=x.d;
                dfs(2);
                sum[0]-=x.a,sum[1]-=x.b,sum[2]-=x.c,sum[3]-=x.d;
            }
            printf("%lld\n",ansans);
        }
        else printf("%lld\n", sum[0] * sum[1] * sum[2] * sum[3]);
    }
    return 0;
}