#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000005

int N,K;
long long ans = 0;
vector<int> A;

void dfs(int L,int R){
	if(R-L<=1)return;
	int M = (L+R)/2;

	dfs(L,M);
	dfs(M,R);
		
	map<int,long long> mpL,mpR,sumR;
	int r = M;
	for(int i=M-1;i>=L;i--){
		mpL[A[i]]++;
		if(mpL.begin()->second>1)continue;
		int m = mpL.begin()->first;
		if(mpR.size()!=0&&mpR.begin()->first<=m)continue;
		while(true){
			if(r==R)break;
			if(A[r]<=m)break;
			mpR[A[r]]++;
			sumR[A[r]]+=r;
			r++;
		}
		int t = K-A[i];
		if(!mpR.count(t))continue;
		ans += sumR[t] - mpR[t]*(i-1);
	}
	mpL.clear();
	mpR.clear();
	sumR.clear();
	r = M-1;
	for(int i=M;i<R;i++){
		mpL[A[i]]++;
		if(mpL.begin()->second>1)continue;
		int m = mpL.begin()->first;

		if(mpR.size()!=0&&mpR.begin()->first<=m)continue;

		while(true){
			if(r<L)break;
			if(A[r]<=m)break;
			mpR[A[r]]++;
			sumR[A[r]]+=r;
			r--;
		}
		int t = K-A[i];
		if(!mpR.count(t))continue;
		ans += mpR[t]*(i+1)-sumR[t];
	}
}
			

int main(){
	
	cin>>N>>K;
	
	A.resize(N);
	for(int i=0;i<N;i++)cin>>A[i];
	
	dfs(0,N);
	
	for(int i=0;i<N;i++)if(A[i]*2==K)ans++;
	
	cout<<ans<<endl;
	
	return 0;
}