#include <bits/stdc++.h>
using namespace std;
int n;

struct node
{
	int t,k,p[300001];
}a[100001];

int book[100001];
int cnt;

int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cnt=0;
		memset(book,0,sizeof(book));
		cin>>a[i].t>>a[i].k;
		for(int j=1;j<=a[i].k;j++)
		{
			cin>>a[i].p[j];
			if(book[a[i].p[j]]!=1)
			{
				cnt++;
				book[a[i].p[j]]=1;
			}
			
			
		}
		
		for(int j=1;j<=i;j++)
		{
			if(a[i].t-a[j].t<86400)
			{
				for(int s=1;s<=a[j].k;s++)
					if(book[a[j].p[s]]!=1)
					{
						cnt++;
						book[a[j].p[s]]=1;
					}		
			}
		}
		cout<<cnt<<endl;
	}
	return 0;
}