P5594 [XR-4] Mock Contest

School X is holding an in-school training camp before CSP. There are $n$ OIers taking part in this training camp, and the coach has carefully prepared $m$ sets of mock contest problems for them. However, each OIer has their own schedule. Coincidentally, in the next $k$ days, each of them happens to have exactly $m$ days free to do mock contests. To make management easier, the coach requires that each person must complete the $m$ sets of mock contests in order. For example, if Xiao X is free on days $2,3,5$ in the next days, then they must do the $1$st set on day $2$, the $2$nd set on day $3$, and the $3$rd set on day $5$. The coach needs to prepare for every person’s every mock contest. To reduce workload, if multiple people do the same set of mock contest problems on the same day, then the coach only needs to prepare one mock contest using that set of problems on that day. As a top student in the lab, the coach wants you to help compute how many mock contests they need to prepare each day.

The first line contains three integers $n,m,k$. In the next $n$ lines, each line contains $m$ integers. The integer $a_{i,j}$ in row $i$ and column $j$ indicates that for the $i$-th person, the $j$-th free day among the next $k$ days is day $a_{i,j}$.

Output one line with $k$ integers. The $i$-th integer indicates the number of mock contests the coach needs to prepare on day $i$ among the next $k$ days.

**This problem uses bundled tests.** - Subtask 1 (13 points): $n = m = k = 1$. - Subtask 2 (24 points): $n = 1$. - Subtask 3 (24 points): $m = 1$. - Subtask 4 (39 points): no special constraints. For $100\%$ of the testdata, $1 \le n,m,k \le 10^3$, $m \le k$, $1 \le a_{i,1} < a_{i,2} < \cdots < a_{i,m} \le k$. Translated by ChatGPT 5