You are given an integer array arrivals, where arrivals[i] represents the type of item that arrives on day i, and two integers w and m.

Items arrive sequentially from day $0$ to day arrivals.length $- 1$. For each day i, an arriving item is discarded if retaining it would cause the frequency of item type arrivals[i] to exceed m within the sliding window of the most recent w days (from day $\max(0, i - w + 1)$ to day i), considering only accepted arrivals. Otherwise, the item is accepted.

Return the total number of arrivals that must be discarded.

Constraints:

• $1 \leq$ arrivals.length $\leq 10^5$

• $1 \leq$ arrivals[i] $\leq 10^5$

• $1 \leq$ w $\leq$ arrivals.length

• $1 \leq$ m $\leq$ w

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.