#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
const int maxn=100010;
queue<int>q;
vector<int>A[maxn];
int k[maxn];
int t[maxn];
int cn[maxn]={0};
int main(){
	freopen("port.in","r",stdin);
	freopen("port.out","w",stdout);
	int n;
	scanf("%d",&n);
	int cnt=0;
	for(int i=1;i<=n;i++){
		scanf("%d %d",&t[i],&k[i]);
		q.push(i);
		int x;
		for(int j=1;j<=k[i];j++){
			scanf("%d",&x);
			A[i].push_back(x);
			if(cn[x]==0)
				cnt++;
			cn[x]++;
		}
		while(!q.empty()&&t[q.front()]<=t[i]-86400){
			for(int j=0;j<A[q.front()].size();j++){
				int u=A[q.front()][j];
				cn[u]--;
				if(!cn[u])
					cnt--;
			}
			q.pop();
		}
		printf("%d\n",cnt);
	}
return 0;
}