#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define Return(ans) { cout << (ans) << endl; return 0; }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;

int calcans(int l, int r, vec &A, int K){
    if(l > r) return 0;
    if(l == r) return (2 * A[l] == K);
    
    int ans = 0;
    int c = (l + r) / 2;
    
    //[l,c]に最小値
    vec v1(c - l + 1), v2(r - c);
    int m = INF;
    bool f = true;
    REP(i, c - l + 1){
        if(A[c - i] == m) f = false;
        else if(A[c - i] < m){
            m = A[c - i];
            f = true;
        }
        if(f) v1[i] = m;
        else v1[i] = -1;
    }
    m = INF;
    map<int, int> num, len;
    REP(i, r - c){
        Min(m, A[c + 1 + i]);
        v2[i] = m;
        num[A[c + 1 + i]] += 1;
        len[A[c + 1 + i]] += i + 1;
    }

    int j = r - c - 1;
    IREP(i, c - l + 1){
        if(v1[i] == -1) continue;
        while(j >= 0 && v1[i] >= v2[j]){
            num[A[c + 1 + j]] -= 1;
            len[A[c + 1 + j]] -= j + 1;
            j--;
        }
        ans += num[K - A[c - i]] * (i + 1) + len[K - A[c - i]];
    }


    //(c,r]に最小値
    v1 = vec(r - c), v2 = vec(c - l + 1);
    m = INF;
    f = true;
    REP(i, r - c){
        if(A[c + 1 + i] == m) f = false;
        else if(A[c + 1 + i] < m){
            m = A[c + 1 + i];
            f = true;
        }
        if(f) v1[i] = m;
        else v1[i] = -1;
    }
    m = INF;
    num.erase(all(num));
    len.erase(all(len));
    REP(i, c - l + 1){
        Min(m, A[c - i]);
        v2[i] = m;
        num[A[c - i]] += 1;
        len[A[c - i]] += i + 1;
    }

    j = c - l;
    IREP(i, r - c){
        if(v1[i] == -1) continue;
        while(j >= 0 && v1[i] >= v2[j]){
            num[A[c - j]] -= 1;
            len[A[c - j]] -= j + 1;
            j--;
        }
        ans += num[K - A[c + 1 + i]] * (i + 1) + len[K - A[c + 1 + i]];
    }



    ans += calcans(l, c, A, K);
    ans += calcans(c + 1, r, A, K);

    return ans;
}

signed main(){

    int N, K; cin >> N >> K;
    vec A(N); cin >> A;

    int ans = calcans(0, N - 1, A, K);
    Out(ans);

    return 0;
}