#include<bits/stdc++.h>
using namespace std;
vector<int>a[100005];
int n,t[100005],k,tong[100005],ans;
int sum(vector<int>a){
	set<int>s;
	for(int i=0;i<a.size();i++)s.insert(a[i]);
	if(a.size()!=0)return s.size();
	else return 0;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>t[i]>>k;
		while(k--){
			int tmp;
			cin>>tmp;
			a[i].push_back(tmp);
			tong[tmp]++;
		}
	}
	int r=1;
	for(int l=1;l<=n;l++){
		for(;t[r]-t[l]<=86400&&r<=n;){
			ans+=sum(a[r]);
			r++;
		}
		if(t[r]-t[l]>86400){
			for(int i=0;i<a[l].size();i++){
				tong[a[l][i]]--;
				if(tong[a[l][i]]==0)ans--;
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}