#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
int INF = 1100000000;
using namespace std;
int main(){
  int N, K;
  cin >> N >> K;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  long long ans = 0;
  for (int i = 0; i < N; i++){
    int m = INF;
    int c = 0;
    for (int j = i; j < N; j++){
      if (m > A[j]){
        m = A[j];
        c = 1;
      } else if (m == A[j]){
        c++;
      }
      if (A[i] + A[j] == K && c == 1){
        ans += j - i + 1;
      }
    }
  }
  cout << ans << endl;
}