You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Problem Description

给定$n, k$, 定义使得 $a[i] \ \%\ a[j] + a[j] \ \%\ a[i] = k$ 的 $(i, j)(1 \leq i \leq n,\ 1 \leq j \leq n,\ i \neq j)$为美丽元组, 求数组$a$中美丽元组的个数

Input Format

第一行两个整数$n$和$k$
第二行$n$个整数为数组$a$的每个元素

Output Format

一行一个整数，表示美丽元组的个数

Sample

输入样例1

2 0
1 1

输出样例1

2

输入样例2

5 4
1 2 3 4 5

输出样例2

2

Hint

$1 \leq n \leq 10^5, \ 0 \leq k \leq 10^5,\ 1 \leq a[i] \leq 10^8,\ \Sigma{a[i]} \leq 10^8$