rt

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+5;
const int times=86400;
vector<int> a;
int t[N],x[N][N],k[N],n,sum,cnt;
main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>t[i]>>k[i];
		for(int j=1;j<=k[i];i++) cin>>x[i][j];
		a[1]=x[t[i]-times][1];
		for(int p=t[i]-times;p<=t[i];p++){
			cnt=0;
			for(int j=2;j<=a.size();j++)
				if(a[j]!=x[p][k[p]]) ++cnt;
			if(cnt==a.size()-1) sum++;
			cout<<sum<<endl;
		}
	}return 0;
}