#include <bits/stdc++.h>
using namespace std;

struct b {
	int time, cont;
};
int c[100005];

int main() {
	int n;
	cin >> n;
	queue<b> a;
	memset(c, 0, sizeof(c));
	int co = 0;
	for (int i = 0; i < n; i++) {
		int t, r, l;
		b k, f;
		cin >> t >> r;
		while (r--) {
			cin >> l;
			k = {t, l};
			a.push(k);
			c[l]++;
			if (c[l] == 1 ) {
				co++;
			}
		}
		while (a.size()) {
			if (k.time - a.front().time   < 86400) {
				break;
			}
			f = a.front();
			a.pop();
			c[f.cont]--;
			if (c[f.cont] <= 0 ) {
				co--;
			}
		}
		cout << co << endl;
	}
	return 0;
}