//g++ -std=c++11 -Wall -O2 -o main.exe main.cpp

#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <algorithm>
#include <complex>
#include <numeric>
//最大公約数: gcd()
//最小公倍数: lcm()

#define ll long long int

using namespace std;

template <typename T>
void in(T &t){ //標準入力
    cin >> t;
    return;
}

template <typename T>
void sortasc(vector<T> &v){ //vectorを昇順にソート
    sort(v.begin(), v.end(), std::greater<int>());
    return;
}

template <typename T>
void sortdesc(vector<T> &v){ //vectorを降順にソート
    sort(v.begin(), v.end(), std::less<int>());
    return;
}

int main(){
    int n, x, temp, count = 0;
    vector<int> v(100001, 0);

    cin >> n >> x;
    for(int i = 0; i < n; i++){
        cin >> temp;
        v[temp]++;
    }

    for(int i = 0; i <= 50000; i++){
        if(i >= x - i){
            if(i == x - i && v[i] != 0) count += v[i];
            break;
        }
        if(v[i] != 0 && v[x - i] != 0){
            count += v[i] * v[x - i] * 2;
        }
    }

    printf("%d\n", count);

    return 0;
}