#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, k; cin >> n >> k;
  vector<int> a(n); REP(i, n) cin >> a[i];
  map<int, vector<int>> mp;
  REP(i, n) mp[a[i]].emplace_back(i);
  map<int, vector<ll>> sum;
  for (auto [key, v] : mp) {
    int sz = v.size();
    vector<ll> vll(sz + 1, 0);
    REP(i, sz) vll[i + 1] = vll[i] + v[i];
    sum[key] = vll;
  }
  set<int> st{-1, n};
  ll ans = 0;
  for (auto [ignore, idx] : mp) {
    for (int e : idx) st.emplace(e);
    for (int i : idx) {
      int l = *prev(st.lower_bound(i)) + 1, r = *st.upper_bound(i) - 1;
      if (i - l < r - i) {
        FOR(j, l, i + 1) {
          if (mp.count(k - a[j]) == 1) {
            int p = lower_bound(ALL(mp[k - a[j]]), i) - mp[k - a[j]].begin();
            int q = upper_bound(ALL(mp[k - a[j]]), r) - mp[k - a[j]].begin();
            ans += sum[k - a[j]][q] - sum[k - a[j]][p] - 1LL * (j - 1) * (q - p);
          }
        }
      } else {
        FOR(j, i, r + 1) {
          if (mp.count(k - a[j]) == 1) {
            int p = lower_bound(ALL(mp[k - a[j]]), l) - mp[k - a[j]].begin();
            int q = upper_bound(ALL(mp[k - a[j]]), i) - mp[k - a[j]].begin();
            ans += 1LL * (j + 1) * (q - p) - (sum[k - a[j]][q] - sum[k - a[j]][p]);
          }
        }
      }
    }
  }
  cout << ans << '\n';
  return 0;
}