Chuchu has got an array of size $n$, now he wants to count number of unordered triplets present in the array such that absolute difference between any two elements of a triplet should be at least $d$. Formally, if $(a, b, c)$ is a triplet then $\lvert a-b\rvert \ge d, \lvert b-c\rvert \ge d\ and\ \lvert c-a\rvert \ge d$.

Help Chuchu in counting such triplets.

Input:

• First line contains a integer $T$ , denoting number of test cases.
• Each test case consists of two lines, first line contains two integers $n$ and $d$ and second line  contains $n$ space separated integers, denoting array elements.

Output:

For each query output the number of triplets satisfying above mentioned condition in a newline.

Constraints:

• $1 \le T \le 5$
• $1 \le n \le 10^{5}$
• $1 \le A_i, d \le 10^9$