The Harbor

Problem Description

Little K is a customs officer at a harbor. Every day many ships arrive at the harbor, usually carrying passengers from many different countries.

Little K is very interested in the ships arriving at the harbor, and he records the situation of each ship arriving at the harbor by time: for the $i$-th arriving ship, he records its arrival time $t_i$ (in seconds), the number of passengers $k_i$ on board, and the nationality $x_{i,1}, x_{i,2},\dots,x_{i,k}$ of each passenger.

Little K has recorded information about $n$ ships, and he hopes you can help calculate, for each ship's arrival time, how many different countries the passengers who arrived by ship within the past $24$ hours ($24$ hours $=86400$ seconds) come from.

Formally, you need to compute $n$ pieces of information. For the $i$-th piece of output information, you need to count the ships $p$ satisfying $t_i-86400<t_p\le t_i$, and among all $x_{p,j}$, how many different numbers there are in total.

Input Format

The first line contains a positive integer $n$, indicating that Little K recorded information about $n$ ships.

The following $n$ lines each describe one ship: the first two integers $t_i$ and $k_i$ represent the arrival time of the ship and the number of passengers on board, and the following $k_i$ integers $x_{i,j}$ represent the nationalities of the passengers on board.

It is guaranteed that the input $t_i$ is increasing, in seconds; starting from when Little K first starts work, this ship arrives at the $t_i$-th second.

It is guaranteed that $1\le n\le 10^5$, $\sum k_i\le 3\times 10^5$, $1\le x_{i,j}\le 10^5$, $1\le t_{i-1}\le t_i\le 10^9$.

Here $\sum k_i$ denotes the sum of all $k_i$.

Output Format

Output $n$ lines; the $i$-th line outputs an integer representing the statistical information after the $i$-th ship arrives.

Sample Input 1

3
1 4 4 1 2 2
2 2 2 3
10 1 3

Sample Output 1

3
4
4

Sample Input 2

4
1 4 1 2 2 3
3 2 2 3
86401 2 3 4
86402 1 5

Sample Output 2

3
3
3
4

Sample Explanation 1

• The first ship arrives at the $1$st second. The ships arriving in the last $24$ hours is the first ship, with $4$ passengers from countries $4,1,2,2$, coming from $3$ different countries in total.
• The second ship arrives at the $2$nd second. The ships arriving in the last $24$ hours are the first and second ships, with $4+2=6$ passengers from countries $4,1,2,2,2,3$, coming from $4$ different countries in total.
• The third ship arrives at the $10$th second. The ships arriving in the last $24$ hours are the first, second, and third ships, with $4+2+1=7$ passengers from countries $4,1,2,2,2,3,3$, coming from $4$ different countries in total.

Sample Explanation 2

• The first ship arrives at the $1$st second. The ships arriving in the last $24$ hours is the first ship, with $4$ passengers from countries $1,2,2,3$, coming from $3$ different countries in total.
• The second ship arrives at the $3$rd second. The ships arriving in the last $24$ hours are the first and second ships, with $4+2=6$ passengers from countries $1,2,2,3,2,3$, coming from $3$ different countries in total.
• The third ship arrives at the $86401$-th second. The ships arriving in the last $24$ hours are the second and third ships, with $2+2=4$ passengers from countries $2,3,3,4$, coming from $3$ different countries in total.
• The fourth ship arrives at the $86402$-th second. The ships arriving in the last $24$ hours are the second, third, and fourth ships, with $2+2+1=5$ passengers from countries $2,3,3,4,5$, coming from $4$ different countries in total.

Constraints

• For $10\%$ of the test points, $n=1$, $\sum k_i\le 10$, $1\le x_{i,j}\le 10$, $1\le t_i\le 10$.
• For $20\%$ of the test points, $1\le n\le 10$, $\sum k_i\le 100$, $1\le x_{i,j}\le 100$, $1\le t_i\le 32767$.
• For $40\%$ of the test points, $1\le n\le 100$, $\sum k_i\le 100$, $1\le x_{i,j}\le 100$, $1\le t_i\le 86400$.
• For $70\%$ of the test points, $1\le n\le 1000$, $\sum k_i\le 3000$, $1\le x_{i,j}\le 1000$, $1\le t_i\le 10^9$.
• For $100\%$ of the test points, $1\le n\le 10^5$, $\sum k_i\le 3\times 10^5$, $1\le x_{i,j}\le 10^5$, $1\le t_i\le 10^9$.