//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};
vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
ll ret=0;
void solve(ll l,ll r,ll k,vector<ll>&a){
  if(r-l==1){
    if(a[l]*2==k)ret++;
    return;
  }
  ll m=(l+r)/2;
  map<ll,vector<ll>>mp;
  map<ll,vector<P>>cum;
  map<ll,vector<P>>cum2;
  P mi=MP(INF,INF);
  rrep(i,l,m){
    if(mi.fi>a[i])mi=MP(a[i],1);
    else if(mi.fi==a[i])mi.se++;
    mp[a[i]].EB(mi.fi);
    if(!cum.count(a[i]))cum[a[i]].EB(0,0);
    if(!cum2.count(a[i]))cum2[a[i]].EB(0,0);
    auto k=cum[a[i]].back();
    cum[a[i]].EB(k.fi+m-i,k.se+1);
    k=cum2[a[i]].back();
    cum2[a[i]].EB(k.fi+(m-i)*(mi.se==1),k.se+(mi.se==1));
  }
  /*for(auto z:cum2){
    cout<<z.fi spa z.se.size()<<endl;
    debug(z.se,z.se.size());
  }*/
  mi=MP(INF,INF);
  rep(i,m,r){
    if(mi.fi>a[i])mi=MP(a[i],1);
    else if(mi.fi==a[i])mi.se++;
    //cout<<i spa mi spa l spa r spa k-a[i] spa mp.count(k-a[i])<<endl;
    if(!mp.count(k-a[i]))continue;
    ll idx=lower_bound(ALL(mp[k-a[i]]),mi.fi,greater<ll>())-mp[k-a[i]].begin();
    //cout<<a[i] spa l spa m spa r spa i spa mi spa idx spa ret<<endl;
    if(mi.se==1)ret+=cum[k-a[i]][idx].fi+(i-m+1)*cum[k-a[i]][idx].se;
    idx=upper_bound(ALL(mp[k-a[i]]),mi.fi,greater<ll>())-mp[k-a[i]].begin();
    auto p1=cum2[k-a[i]][(ll)mp[k-a[i]].size()];
    auto p2=cum2[k-a[i]][idx];
    //cout<<ret spa p1 spa p2<<endl;
    ret+=p1.fi-p2.fi+(p1.se-p2.se)*(i-m+1);
  }
  solve(l,m,k,a);
  solve(m,r,k,a);
}
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n,k;cin>>n>>k;
  vector<ll>a(n);
  rep(i,0,n)cin>>a[i];
  solve(0,n,k,a);
  cout<<ret<<endl;
  return 0;
}