#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

std::vector<int> a;
int k;

int64_t res = 0;
void solve(int l, int r) {
	if (r - l == 1) {
		if (a[l] * 2 == k) res += 1;
		return;
	}
	int m = l + ((r - l) >> 1);
	int min = 1000000000;
	int cnt = 0;
	std::map<int, std::pair<int, int64_t> > right; // val : {cnt, index sum}
	std::map<std::pair<int, int>, std::pair<int64_t, int> > right_special; // {val, min} : {cnt, index sum}
	for (int i = m; i < r; i++) {
		if (min > a[i]) min = a[i], cnt = 1;
		else if (min == a[i]) cnt++;
		if (cnt > 1) continue;
		auto &r0 = right[a[i]];
		r0.first++;
		r0.second += i;
		auto &r1 = right_special[{a[i], min}];
		r1.first++;
		r1.second += i;
	}
	min = 1000000000;
	cnt = 0;
	for (int i = m - 1; i >= l; i--) {
		if (min > a[i]) min = a[i], cnt = 1;
		else if (min == a[i]) cnt++;
		if (cnt > 1) continue;
		auto &r0 = right[k - a[i]];
		auto &r1 = right_special[{k - a[i], min}];
		int cnt = r0.first - r1.first;
		int64_t sum = r0.second - r1.second;
		res += sum;
		res -= (int64_t) cnt * (i - 1);
	}
	solve(l, m);
	solve(m, r);
}


int main() {
	int n = ri();
	k = ri();
	a.resize(n);
	for (auto &i : a) i = ri();
	solve(0, n);
	printf("%" PRId64 "\n", res);
	return 0;
}