#include <bits/stdc++.h>
using namespace std;
using lld = long double;
using ll = long long int;
using ar = vector<ll>;
using mat = vector<vector<ll>>;
mat cn(ll n, ll m) { return vector<vector<ll>>(n, vector<ll>(m)); }
ll const MOD = 1e9 + 7;
template <class T>
inline bool chmin(T &a, T b) {
  return a > b ? a = b, 1 : 0;
}
template <class T>
inline bool chmax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
}
template <class T>
inline void add(T &a, T b) {
  a += b;
  a >= MOD ? a - MOD : a;
}
template <class T>
inline void sub(T &a, T b) {
  a -= b;
  a < 0 ? a + MOD : a;
}
template <class T>
inline void mul(T &a, T b) {
  return (a * b) % MOD;
}
template <class T>
void remDup(vector<T> &v) {
  sort((v).begin(), (v).end());
  v.erase(unique((v).begin(), (v).end()), end(v));
}
bool comp1(char &s1, char &s2) { return s1 > s2; }
bool comp2(const pair<ll, pair<ll, ll>> &a, const pair<ll, pair<ll, ll>> &b) {
  if (a.first > b.first) return 1;
  if (a.first == b.first && a.second.second > b.second.second) return 1;
  return 0;
}
class Pair {
 public:
  ll first, second;
};
bool comp3(const Pair &a, const Pair &b) {
  if (a.first > b.first) return 1;
  return 0;
}
class Trips {
 public:
  ll first, second, third;
};
bool comp4(const Trips &a, const Trips &b) {
  if (a.third > b.third) return 1;
  return 0;
}
void readArray(ll a[], int n) {
  for (ll i = 0; i < n; i++) cin >> a[i];
}
ll const inf = 1e18;
ll const mod = 1e9 + 7;
ll const maxn = 5e5 + 1;
void solve() {
  ll t1 = 1;
  for (ll tt = 1; tt <= t1; tt++) {
    ll n, m;
    cin >> n >> m;
    ll a[n];
    for (ll i = 0; i < n; i++) cin >> a[i];
    ll diff = 0;
    map<ll, ll> store;
    ll f = 0;
    ll ans = 0;
    store[0] = 1;
    for (ll i = 0; i < n; i++) {
      if (a[i] > m) diff++;
      if (a[i] < m) diff--;
      if (a[i] == m) f = 1;
      if (f)
        ans += store[diff - 1] + store[diff];
      else
        store[diff]++;
    }
    cout << ans << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
  return 0;
}

### Prompt

Please create a solution in CPP to the following problem:

You are given a permutation p_1, p_2, ..., p_n. A permutation of length n is a sequence such that each integer between 1 and n occurs exactly once in the sequence.

Find the number of pairs of indices (l, r) (1 ≤ l ≤ r ≤ n) such that the value of the median of p_l, p_{l+1}, ..., p_r is exactly the given number m.

The median of a sequence is the value of the element which is in the middle of the sequence after sorting it in non-decreasing order. If the length of the sequence is even, the left of two middle elements is used.

For example, if a=[4, 2, 7, 5] then its median is 4 since after sorting the sequence, it will look like [2, 4, 5, 7] and the left of two middle elements is equal to 4. The median of [7, 1, 2, 9, 6] equals 6 since after sorting, the value 6 will be in the middle of the sequence.

Write a program to find the number of pairs of indices (l, r) (1 ≤ l ≤ r ≤ n) such that the value of the median of p_l, p_{l+1}, ..., p_r is exactly the given number m.

Input

The first line contains integers n and m (1 ≤ n ≤ 2⋅10^5, 1 ≤ m ≤ n) — the length of the given sequence and the required value of the median.

The second line contains a permutation p_1, p_2, ..., p_n (1 ≤ p_i ≤ n). Each integer between 1 and n occurs in p exactly once.

Output

Print the required number.

Examples

Input

5 4
2 4 5 3 1


Output

4


Input

5 5
1 2 3 4 5


Output

1


Input

15 8
1 15 2 14 3 13 4 8 12 5 11 6 10 7 9


Output

48

Note

In the first example, the suitable pairs of indices are: (1, 3), (2, 2), (2, 3) and (2, 4).

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
using lld = long double;
using ll = long long int;
using ar = vector<ll>;
using mat = vector<vector<ll>>;
mat cn(ll n, ll m) { return vector<vector<ll>>(n, vector<ll>(m)); }
ll const MOD = 1e9 + 7;
template <class T>
inline bool chmin(T &a, T b) {
  return a > b ? a = b, 1 : 0;
}
template <class T>
inline bool chmax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
}
template <class T>
inline void add(T &a, T b) {
  a += b;
  a >= MOD ? a - MOD : a;
}
template <class T>
inline void sub(T &a, T b) {
  a -= b;
  a < 0 ? a + MOD : a;
}
template <class T>
inline void mul(T &a, T b) {
  return (a * b) % MOD;
}
template <class T>
void remDup(vector<T> &v) {
  sort((v).begin(), (v).end());
  v.erase(unique((v).begin(), (v).end()), end(v));
}
bool comp1(char &s1, char &s2) { return s1 > s2; }
bool comp2(const pair<ll, pair<ll, ll>> &a, const pair<ll, pair<ll, ll>> &b) {
  if (a.first > b.first) return 1;
  if (a.first == b.first && a.second.second > b.second.second) return 1;
  return 0;
}
class Pair {
 public:
  ll first, second;
};
bool comp3(const Pair &a, const Pair &b) {
  if (a.first > b.first) return 1;
  return 0;
}
class Trips {
 public:
  ll first, second, third;
};
bool comp4(const Trips &a, const Trips &b) {
  if (a.third > b.third) return 1;
  return 0;
}
void readArray(ll a[], int n) {
  for (ll i = 0; i < n; i++) cin >> a[i];
}
ll const inf = 1e18;
ll const mod = 1e9 + 7;
ll const maxn = 5e5 + 1;
void solve() {
  ll t1 = 1;
  for (ll tt = 1; tt <= t1; tt++) {
    ll n, m;
    cin >> n >> m;
    ll a[n];
    for (ll i = 0; i < n; i++) cin >> a[i];
    ll diff = 0;
    map<ll, ll> store;
    ll f = 0;
    ll ans = 0;
    store[0] = 1;
    for (ll i = 0; i < n; i++) {
      if (a[i] > m) diff++;
      if (a[i] < m) diff--;
      if (a[i] == m) f = 1;
      if (f)
        ans += store[diff - 1] + store[diff];
      else
        store[diff]++;
    }
    cout << ans << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
  return 0;
}

```