#include <bits/stdc++.h>
using namespace std;
struct node
{
    int t;
    int v;
};
queue<node>qu;
node flag;
int vis[300005];
int owo;
int main()
{
    memset(vis,0,sizeof(vis));
    int n,i,j,t,m,ans;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d%d",&t,&m);
        while(!qu.empty())
        {
            flag=qu.front();
            if(flag.t+86400<=t)
            {
                vis[flag.v]--;
                if(vis[flag.v]==0)
                {
                    ans--;
                }
                qu.pop();
                continue;
            }
            break;
        }
        for(j=1;j<=m;j++)
        {
            scanf("%d",&owo);
            flag.t=t;
            flag.v=owo;
            qu.push(flag);
            vis[owo]++;
            if(vis[owo]==1)
            {
                ans++;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}