#include<bits/stdc++.h>
using namespace std;
int ans=0;
int a[100000005]; 
struct id{
	int time;
	int na;
};
id flag;
queue<id>q;
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		int sj,many;
		cin>>sj>>many;
		while(!q.empty())
		{
			if(q.front().time-sj>=86400)
			{
				a[q.front().time]--;
				if(a[q.front().time]==0) ans--;
				q.pop();
				continue;
			}
			else
			{
				break;
			}
		}
		for(int p=1;p<=many;p++)
		{
			int gj;
			cin>>gj;
			flag.na=gj;
			flag.time=sj;
			q.push(flag);
			a[gj]++;
			if(a[gj]==1) ans++;
		}
		cout<<ans<<endl;
	}
	return 0;
}