You are given an integer n representing the total number of servers, indexed from $1$ to n. You are also given a $2$D integer array logs where logs[i] = [server_id, time] indicates that the server with identifier server_id received a request at time time.

Additionally, you are given an integer x and an integer array queries.

For each query queries[j], determine the count of servers that received zero requests in the time interval $[$ queries[j] $- x,$ queries[j] $]$ (inclusive).

Return an array ans of length queries.length where ans[j] is the answer to the $j^{ ext{th}}$ query.

Constraints:

• $1 \leq$ n $\leq 10^5$

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

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

• logs[i].length $= 2$

• $1 \leq$ logs[i][0] $\leq$ n

• $1 \leq$ logs[i][1] $\leq 10^6$

• $1 \leq$ x $\leq 10^5$

• x $<$ queries[i] $\leq 10^6$

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.