import std;

void main () {
    int N, M; readln.read(N, M);
    int[] A = readln.split.to!(int[]);

    solve(N, M, A);
}

void solve (int N, int M, int[] A) {
    /* 円周角の定理 */
    long ans = 0;
    bool[long] mp;
    foreach (a; A) mp[2*a] = true;

    foreach (a; A) if ((1L*2*a+M) in mp) ans += N-2;

    writeln(ans);
}

void read(T...)(string S, ref T args) {
    auto buf = S.split;
    foreach (i, ref arg; args) {
        arg = buf[i].to!(typeof(arg));
    }
}