// PR Bab 11, soal 1 -- pembahasan.

#include <iostream>
using namespace std;

const int MAKS = 2005;
int a[MAKS];

int main() {
    int n, k;
    cin >> n >> k;
    for (int i = 0; i < n; i++) cin >> a[i];

    int banyak = 0;
    for (int i = 0; i < n; i++)
        for (int j = i + 1; j < n; j++)
            if (a[i] + a[j] == k) banyak++;

    cout << banyak << "\n";
    return 0;
}