#include <iostream>
#include <queue>
using namespace std;
struct ship {
    int t, k;
    int kk[105];
} s[100005];
int b[300005];
int shead, stail;
int ans;
/*void print() {
    for (int i = 0; i < 300000; i++) {
        if (b[i] != 0) cout << i << " ";
    }
    cout << endl;
}*/
int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> s[stail].t >> s[stail].k;
        for (int j = 0; j < s[stail].k; j++) {
            cin >> s[stail].kk[j];
            if (b[s[stail].kk[j]] == 0) ans++;
            b[s[stail].kk[j]]++;
        }
        stail++;
        while (s[stail].t >= s[shead].t + 86400) {
            for (int j = 0; j < s[shead].k; j++) {
                if (b[s[shead].kk[j]] - 1 == 0) ans--;
                b[s[shead].kk[j]]--;
            }
            shead++;
        }
        cout << ans << endl;
        //print();
    }
    return 0;
}

另外说k个数不定用vector的就算了 先把这个bug干掉再说