#include<cstdio>
#include<iostream>
#include<vector>
#define mysister
#define maxn 86400
using namespace std;
int n,before=1,to[maxn],from[maxn],now=0,t[100001],k,g[maxn],x;
vector<int>ship[maxn];
int main()
{
	freopen("port.in","r",stdin);
	freopen("port.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
	  scanf("%d%d",&t[i],&k);
	  while(t[i]-maxn>=t[before])
	  {
	  	for(int j=1;j<=ship[before][0];j++)
		{
		  g[ship[before][j]]--;
		  if(g[ship[before][j]]==0){to[from[ship[before][j]]]=to[ship[before][j]];from[to[ship[before][j]]]=from[ship[before][j]];}
		}
	  	before++;
	  }
	  ship[i].push_back(k);
	  for(int j=1;j<=k;j++)
	  {
	    scanf("%d",&x);
	    ship[i].push_back(x);
	    if(g[x]==0){to[now]=x;from[x]=now;now=x;}
	    g[x]++;
	  }
	  int cf=0,ans=0;
	  while(to[cf]!=0)
	  {
	  	ans++;
	  	cf=to[cf];
	  }
	  printf("%d\n",ans);
	}
	return 0;
}