#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>

using namespace std;



int main() {
	int i, j, k;
	long n, x;
	vector<long>a;

	cin >> n >> x;

	long cnt3 = 0;

	for (i = 0; i < n; i++) {
		long aa;
		cin >> aa;
		if (aa > x) {
			cnt3++;
		}
		else {
			a.push_back(aa);
		}
	}

	sort(a.begin(), a.end());

	long cnt = 0, cnt2 = 0;

	for (i = 0; i < n - cnt3; i++) {
		//if (a[i] > x)break;

		cnt += count(a.begin(), a.end(), x - a[i]);
	}

	cout << cnt << endl;

	/*
	for (i = 0; i < n; i++) {
		for (j = i; j < n; j++) {
	
			if (a[i] + a[j] == x) {
				if (i == j) {
					cnt2++;
				}
				else {
					cnt++;
				}
			}
		}
	}
	
	cout << cnt * 2 + cnt2 << endl;
	*/


	getchar();
	getchar();
	return 0;
}