#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
#include<iomanip>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL<<60

int a[100001];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N, X;
	cin >> N >> X;
	for (int i = 0; i < N; i++) cin >> a[i];
	sort(a, a + N);

	ll ans = 0LL;

	for (int i = 0; i < N; i++) {
		ans += upper_bound(a, a + N, X - a[i]) - lower_bound(a, a + N, X - a[i]);
	}

	cout << ans << endl;

	return 0;
}