#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int n, k;
int a[100010];
ll ans;
void solve(int l, int r){
	if(l==r){
		if(a[l]+a[r]==k) ans++;
		return;
	}
	int m=(l+r)/2;
	int mn=1e9+7, cnt=0;
	map<int, ll> mp1, mp11;
	map<P, ll> mp2, mp22;
	for(int i=m; i>=l; i--){
		if(mn>a[i]){
			mn=a[i], cnt=1;
		}else if(mn==a[i]){
			cnt++;
		}
		if(cnt==1){
			mp1[a[i]]++;
			mp2[{a[i], mn}]++;
			mp11[a[i]]+=(m+1-i);
			mp22[{a[i], mn}]+=(m+1-i);
		}
	}
	mn=1e9+7, cnt=0;
	for(int i=m+1; i<=r; i++){
		if(mn>a[i]){
			mn=a[i], cnt=1;
		}else if(mn==a[i]){
			cnt++;
		}
		if(cnt==1){
			auto itr1=mp1.find(k-a[i]);
			if(itr1!=mp1.end()){
				ans+=itr1->second*(i-m);
				ans+=mp11[k-a[i]];
				auto itr2=mp2.find({k-a[i], mn});
				if(itr2!=mp2.end()){
					ans-=itr2->second*(i-m);
					ans-=mp22[{k-a[i], mn}];
				}
			}
		}
	}
	solve(l, m); solve(m+1, r);
}
int main()
{
	cin>>n>>k;
	for(int i=0; i<n; i++){
		cin>>a[i];
	}
	solve(0, n-1);
	cout<<ans<<endl;
	return 0;
}