#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);


struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

void solve() {
	int n, k; cin >> n >> k;
	vector<int> a(n);
	rep(i, n) {
		cin >> a[i];
	}
	ll ans = 0;
	function<void(int, int)> calc = [&](int l, int r) {
		if (l+1 == r) {
			if (a[l] + a[l] == k)ans++;
			return;
		}
		int m = (l + r) / 2;
		//[l,m),[m,r]
		calc(l, m);
		calc(m, r);
		int mi = mod;
		int num = 0;

		vector<int> vs;
		for (int i = m; i < r; i++)vs.push_back(a[i]);
		sort(all(vs));
		vs.erase(unique(all(vs)), vs.end());

		vector<vector<P>> c1(vs.size()),c2(vs.size());
		for (int i = m; i < r; i++) {
			if (a[i] < mi) {
				mi = a[i]; num = 1;
			}
			else if (a[i] == mi) {
				num++;
			}
			int id = lower_bound(all(vs), a[i]) - vs.begin();
			c2[id].push_back({ mi,i-m+1 });
			if (num == 1)c1[id].push_back({ mi,i-m+1 });
		}
		vector<vector<ll>> sum1(vs.size()), sum2(vs.size());
		rep(i, vs.size()) {
			sort(all(c1[i]));
			sort(all(c2[i]));
			sum1[i].resize(c1[i].size() + 1);
			sum2[i].resize(c2[i].size() + 1);
			rep(j, c1[i].size()) {
				sum1[i][j + 1] = sum1[i][j] + c1[i][j].second;
			}
			rep(j, c2[i].size()) {
				sum2[i][j + 1] = sum2[i][j] + c2[i][j].second;
			}
		}

		mi = mod, num = 0;
		for (int i = m - 1; i >= l; i--) {
			if (a[i] < mi) {
				mi = a[i]; num = 1;
			}
			else if (a[i] == mi) {
				num++;
			}
			int to = k - a[i];
			int id = lower_bound(all(vs), to) - vs.begin();
			if (id == vs.size() || vs[id] != to)continue;
			int loc = lower_bound(all(c1[id]), P{ mi,-1 }) - c1[id].begin();
			ans += (ll)loc*(m - i) + sum1[id][loc];

			if (num == 1) {
				int loc = lower_bound(all(c2[id]), P{ mi + 1,-1 }) - c2[id].begin();
				int len = c2[id].size();
				ans += (ll)(len - loc)*(m - i) + sum2[id][len] - sum2[id][loc];
			}
		}
	};

	calc(0, n);
	cout << ans << "\n";
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//int t; cin >> t;rep(i,t)
	solve();
	stop
		return 0;
}