#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main() {
	int N, K;
	cin >> N >> K;
	vector<int> A(N);
	for (int i = 0; i < N; ++i) {
		cin >> A[i];
	}
	int sz = 1;
	while (sz < N) sz *= 2;
	vector<int> seg(2 * sz);
	for (int i = 0; i < N; ++i) {
		seg[i + sz] = A[i];
	}
	for (int i = sz - 1; i >= 1; --i) {
		seg[i] = min(seg[i * 2], seg[i * 2 + 1]);
	}
	function<int(int, int)> rangemin = [&](int l, int r) {
		l += sz; r += sz;
		int ans = 1 << 30;
		while (l != r) {
			if (l & 1) ans = min(ans, seg[l++]);
			if (r & 1) ans = min(ans, seg[--r]);
			l >>= 1; r >>= 1;
		}
		return ans;
	};
	vector<int> comp = A;
	sort(comp.begin(), comp.end());
	comp.erase(unique(comp.begin(), comp.end()), comp.end());
	int S = comp.size();
	vector<vector<int> > g(S);
	for (int i = 0; i < N; ++i) {
		g[lower_bound(comp.begin(), comp.end(), A[i]) - comp.begin()].push_back(i);
	}
	vector<vector<long long> > g2(S);
	for (int i = 0; i < S; ++i) {
		g2[i].resize(g[i].size() + 1);
		for (int j = 0; j < g[i].size(); ++j) {
			g2[i][j + 1] = g2[i][j] + g[i][j];
		}
	}
	function<pair<int, long long>(int, int, int)> rangecount = [&](int l, int r, int x) {
		if (!binary_search(comp.begin(), comp.end(), x)) return make_pair(0, 0LL);
		int ptr = lower_bound(comp.begin(), comp.end(), x) - comp.begin();
		int pl = lower_bound(g[ptr].begin(), g[ptr].end(), l) - g[ptr].begin();
		int pr = lower_bound(g[ptr].begin(), g[ptr].end(), r) - g[ptr].begin();
		return make_pair(pr - pl, g2[ptr][pr] - g2[ptr][pl]);
	};
	function<long long(int, int)> calc = [&](int l, int r) {
		if (r - l <= 0) return 0LL;
		int mn = rangemin(l, r);
		int ptr = lower_bound(comp.begin(), comp.end(), mn) - comp.begin();
		int pl = lower_bound(g[ptr].begin(), g[ptr].end(), l) - g[ptr].begin();
		int pr = lower_bound(g[ptr].begin(), g[ptr].end(), r) - g[ptr].begin();
		vector<int> seq(g[ptr].begin() + pl, g[ptr].begin() + pr);
		seq.insert(seq.begin(), l - 1);
		seq.push_back(r);
		long long ans = 0;
		for (int i = 2; i < seq.size(); ++i) {
			int ls = seq[i - 1] - seq[i - 2];
			int rs = seq[i] - seq[i - 1];
			if (ls < rs) {
				for (int j = seq[i - 2] + 1; j < seq[i - 1] + 1; ++j) {
					pair<int, long long> res = rangecount(seq[i - 1], seq[i], K - A[j]);
					ans += res.second - 1LL * (j - 1) * res.first;
				}
			}
			else {
				for (int j = seq[i - 1]; j < seq[i]; ++j) {
					pair<int, long long> res = rangecount(seq[i - 2] + 1, seq[i - 1] + 1, K - A[j]);
					ans += 1LL * (j + 1) * res.first - res.second;
				}
			}
		}
		for (int i = 1; i < seq.size(); ++i) {
			ans += calc(seq[i - 1] + 1, seq[i]);
		}
		return ans;
	};
	long long res = calc(0, N);
	cout << res << endl;
	return 0;
}