#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<bitset>
#include<set>
#define int long long
#define lowbit(x) x&(-x)
#define mp make_pair
#define rep(i,x,n) for(int i=x;i<=n;i++)
#define per(i,n,x) for(int i=n;i>=x;i--)
#define forE(i,x) for(int i=head[x];i;i=nxt[i])
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int maxn=2e6+5;
const int maxm=2e6+5;
const int mod=998244353;
const int INF=1e18;
inline int read()
{
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+(c-'0');
		c=getchar();
	}
	return x*f;
}

struct BIT {
    vector<int> s; int sz;
    void clear(int SZ) {for(int i=0;i<=SZ+2;i++) s[i]=0;} 
    void build(int SZ) {sz = SZ + 5, s.resize(sz); return;}
    void add(int x, int v) {for (; x < sz; x += (x & -x)) s[x] += v; return;}
    int ask(int x) {int ret = 0;  for (; x; x -= (x & -x)) ret += s[x]; return ret;}
}S,Q;


struct node{
	int x;
	vector<int> e;
}a[maxn];
vector<int> pos[maxn];
inline bool cmp(node x,node y) {return x.x<y.x;}
signed main()
{
	int T=read();
	while(T--)
	{
		int n=read(),m=read();
		S.build(n);Q.build(n);
		S.clear(n);Q.clear(n);
		rep(i,1,n)  
		{
			a[i].e.clear();
			a[i].x=read();
			int p=read();
			rep(j,1,p) a[i].e.push_back(read());
		}
		rep(i,1,m) pos[i].clear();
		sort(a+1,a+n+1,cmp);
		rep(i,1,n) for(auto u:a[i].e) pos[u].push_back(i);
		rep(i,1,m)
		{
			int siz=pos[i].size();
			for(int j=0;j<siz-1;j++)
			{
				int l=pos[i][j],r=pos[i][j+1]-1;
				if(l>r) continue;
				int p1=l,p2=r+1,res=l;
				while(l<=r)
				{
					int mid=(l+r)/2;
					if(a[mid].x-a[p1].x<=a[p2].x-a[mid].x) l=mid+1,res=mid;
					else r=mid-1;
				}
				S.add(p1,-a[p1].x);S.add(res+1,a[p1].x);
				Q.add(p1,1);Q.add(res+1,-1);
				S.add(res+1,a[p2].x);S.add(p2,-a[p2].x);
				Q.add(res+1,-1);Q.add(p2,1);
//				printf("%lld %lld %lld : %lld\n",i,p1,p2,res);
			}
			int p0=pos[i][0];
			S.add(1,a[p0].x);S.add(p0,-a[p0].x);
			Q.add(1,-1);Q.add(p0,1);
			int p=pos[i][siz-1];
			S.add(p,-a[p].x);S.add(n+1,a[p].x);
			Q.add(p,1);Q.add(n+1,-1);
		//	printf("%lld : %lld %lld\n",i,Q.ask(4),S.ask(4));
		}
		int ans=INF;
		rep(i,1,n) 
		{
		//	printf("%lld : %lld %lld\n",i,Q.ask(i),S.ask(i));
			ans=min(ans,S.ask(i)+Q.ask(i)*a[i].x);
		}
		printf("%lld\n",ans);
	}
}