#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>;
template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define LINF (9223372036854775807LL)
#define EPS (1e-10)
#define endl ('\n')
//#define MOD 1000000007LL
#define MOD 998244353LL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}
template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}
#define rep(i,n) for(lint i=0;i<lint(n);++i)
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrep(i,n) for(lint i=lint(n)-1;i>=0;--i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
#define all(n) begin(n),end(n)
#define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2))
inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;}
inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;}
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
auto call=[](auto f,auto... args){return f(f,args...);};


template<typename T>
class pvector{
    struct node;
    using np=node*;
    struct node{
        T data;
        np ch[16];
        node(){
            for(int i=0;i<16;i++)ch[i]=nullptr;
        }
    };
    np root=nullptr;
    np set(int idx,T val,np t){
        np res=t?new node(*t):new node();
        if(idx==0)res->data=val;
        else res->ch[idx&15]=set(idx>>4,val,res->ch[idx&15]);        
        return res;
    }
    T get(int idx,np t){
        if(!t)return T();
        return idx?get(idx>>4,t->ch[idx&15]):t->data;
    }
    public:
    pvector(){}
    pvector(np t):root(t){}
    T get(int idx){
        return get(idx,root);
    }
    pvector set(int idx,T val){
        return pvector(set(idx,val,root));
    }
};

int main(){
    lint n,k;
    cin>>n>>k;
    vec a(n);
    rep(i,n)cin>>a[i];
    vec l(n),r(n);
    stack<lint>stk;
    rrep(i,n){
        while(!stk.empty()&&a[stk.top()]>=a[i]){
            l[stk.top()]=i+1;
            stk.pop();
        }
        stk.emplace(i);
    }
    while(!stk.empty()){l[stk.top()]=0;stk.pop();}
    rep(i,n){
        while(!stk.empty()&&a[stk.top()]>=a[i]){
            r[stk.top()]=i-1;
            stk.pop();
        }
        stk.emplace(i);
    }
    while(!stk.empty()){r[stk.top()]=n-1;stk.pop();}
    vector<pvector<lint>>v(n+1);
    vector<pvector<lint>>v2(n+1);
    rep(i,n){
        v[i+1]=v[i];
        v[i+1]=v[i+1].set(a[i],v[i+1].get(a[i])+1);
        v2[i+1]=v2[i];
        v2[i+1]=v2[i+1].set(a[i],v2[i+1].get(a[i])+i);
    }
    lint ans=0;
    rep(i,n){
        //if(i-l[i]<r[i]-i){
            repi(j,l[i],i+1){
                if(k-a[j]<0)continue;
                ans+=(v2[r[i]+1].get(k-a[j])-v2[i].get(k-a[j]))-(v[r[i]+1].get(k-a[j])-v[i].get(k-a[j]))*(j-1);
            }
        // }else{
        //     repi(j,i,r[i]+1){
        //         if(k-a[j]<0)continue;
        //         ans+=(v[i+1].get(k-a[j])-v[l[i]].get(k-a[j]))*(j+1)-(v2[i+1].get(k-a[j])-v2[l[i]].get(k-a[j]));
        //     }
        // }
    }
    cout<<ans<<endl;
}