Counting close pairs in a range

You are given a sequence $A_1, A_2, \dots, A_N$ of length $N$ and an integer $K$. Write a program that answers $M$ queries of the following form.

• l r: print the number of pairs $(i, j)$ with $l \le i < j \le r$ and $|A_i - A_j| \le K$.

The first line contains the length of the sequence $N$ and the integer $K$ ($1 \le N \le 100000$, $1 \le K \le 100000$).

The second line contains $A_1, A_2, \dots, A_N$ separated by spaces ($1 \le A_i \le 100000$).

The third line contains the number of queries $M$ ($1 \le M \le 100000$).

Each of the next $M$ lines contains one query as two integers $l$ and $r$ ($1 \le l \le r \le N$).

For each query, print the answer on its own line, in the order the queries are given.