You are given the activity logs of users on a platform and an integer k. The logs are represented by a $2\text{D}$ integer array logs, where each logs[i] $= [\text{ID}_i, \text{time}_i]$ indicates that the user with ID $\text{ID}_i$ performed an action at minute $\text{time}_i$.

Multiple users can perform actions simultaneously, and a single user can perform multiple actions in the same minute.

The User Active Minutes (UAM) for a user is defined as the number of unique minutes during which the user performed at least one action. Even if a user performs multiple actions within the same minute, that minute is only counted once toward their UAM.

Return a $1\text{-indexed}$ integer array answer of size k such that, for each $j$ ($1 \leq j \leq$ k), answer[j - 1] is the number of users whose UAM is equal to $j$.

Constraints:

• $1 \leq$ logs.length $\leq 10^4$

• $0 \le \text{ID}_i \le 10^9$

• $1 \le \text{time}_i \le 10^5$

• k is in the range $[\text{maximum UAM of any user}, 10^5]$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.