#include <iostream>
#include<queue>
#include<vector>
#include<string.h>
#include<cstdio>
using namespace std;
int nums[100010];
typedef struct {
int t,num;
}node;
queue<node> lists;
int n;
int sum;
int main() {
cin>>n;
int curt,curn,curg;
int last=0;
node tmp;
int it;
memset(nums,0,sizeof(nums));
for(int i=0;i<n;i++) {
scanf("%d%d",&curt,&curn);
for(int j=0;j<curn;j++) {
scanf("%d",&tmp.num);
tmp.t=curt;
if(nums[tmp.num]==0) sum++;
nums[tmp.num]++; lists.push(tmp);
}
tmp=lists.front();
while(curt-tmp.t>=86400)
{
nums[tmp.num]--;
if(nums[tmp.num]==0)
sum--;
lists.pop();
tmp=lists.front();
}
printf("%d",sum);
printf("\n");
}
return 0;
}