球跳

#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<ctime>
#include<cstdlib>
#define ll long long
//#include<cmath>
using namespace std;
const int constant=1e5+5;
int n,b[constant],t[constant],k[constant],x[constant],s,num,ss=1;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d%d",&t[i],&k[i]);
	}
	for(int i=1,j=1;i<=n;i++){
		for(int q=1;q<=k[i];q++){
			scanf("%d",&x[++s]);
			if(!b[x[s]])num++;
			b[x[s]]++;
		}
		while(t[i]-t[j]>=86400){
			for(int q=1;q<=k[i];q++){
				if(b[x[ss]]==1) num--;
				b[x[ss++]]--;
			}
			j++;
		}
		printf("%d\n",num);
	}
	return 0;
}