#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<deque>
#include<queue>
using namespace std;
typedef long long ll;
const int maxn=1e5+10;
struct node{
	int ti,super;
}a;
queue<node> q;
int b[maxn];
int main(){
	int n,sum=0; 
	cin>>n;
	for(int i=1;i<=n;i++){
		while(!q.empty()){
			q.pop();
		}
		int t,k;
		cin>>t>>k;
		a=q.front();
		while(!q.empty()){
			if(a.ti<=t-86400){
				b[a.super]--;
				if(!b[a.super]) sum--;
				q.pop();
			}
		}
		for(int i=1;i<=k;i++){
			int x;
			cin>>x;
			a.ti=t;
			a.super=x;
			q.push(a);
			b[x]++;
			if(b[x]==1) sum++;
		}
		cout<<sum<<endl;
	}
	return 0;
}

40分求助!