#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const double PI = acos(-1.0);
const int MAXN = 2e5 + 5;
const int MAXM = 2e6 + 5;
const int MOD = 1e9 + 7;
int sgn(double x) {
  if (fabs(x) < eps) return 0;
  if (x < 0)
    return -1;
  else
    return 1;
}
long long pw(long long a, long long n, long long mod) {
  long long ret = 1;
  while (n) {
    if (n & 1) ret = ret * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return ret;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
void inc(long long &a, long long b) {
  a += b;
  if (a >= MOD) a -= MOD;
}
void dec(long long &a, long long b) {
  a -= b;
  if (a < 0) a += MOD;
}
int mul(int a, int b) {
  long long c = 1ll * a * b;
  return c - c / MOD * MOD;
}
int n, m, k, a[MAXN], s[MAXN], c[MAXN];
vector<int> ve;
int getid(int x) {
  return lower_bound((ve).begin(), (ve).end(), x) - ve.begin() + 1;
}
void upd(int x) {
  for (; x <= k; x += x & -x) c[x]++;
}
int qry(int x) {
  int ret = 0;
  for (; x; x -= x & -x) ret += c[x];
  return ret;
}
long long get(int x) {
  ve.clear();
  memset(c, 0, sizeof(c));
  s[0] = 0;
  ve.push_back(0);
  for (int i = 1; i < n + 1; i++)
    s[i] = s[i - 1] + (a[i] >= x ? 1 : -1), ve.push_back(s[i]);
  sort((ve).begin(), (ve).end());
  ve.erase(unique((ve).begin(), (ve).end()), ve.end());
  k = ((int)(ve).size());
  long long ret = 0;
  upd(getid(0));
  for (int i = 1; i < n + 1; i++) {
    int pos = getid(s[i]);
    ret += qry(pos - 1);
    upd(pos);
  }
  return ret;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i < n + 1; i++) scanf("%d", &a[i]);
  printf("%lld\n", get(m) - get(m + 1));
}
