#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <fstream>
#include<stdlib.h>
#define rep( i, l, r ) for (int i = l; i <= r; i++)
#define down( i, l, r ) for (int i = l; i >= r; i--)
using namespace std;
int n, s, num[100009], Left[2][200009], Right[2][200009];
int main()
{
scanf("%d%d", &n, &s);
rep(i, 1, n) scanf("%d", &num[i]);
rep(k, 1, n) if (num[k] == s)
{
int a = 0; int b = 0;
Left[0][n] = Right[0][n] = 1;
down(i, k-1, 1)
{
if (num[i] < num[k]) a++; else b++;
Left[(k-i) % 2][a-b+n]++;
}
a = b = 0;
rep(i, k+1, n)
{
if (num[i] < num[k]) a++; else b++;
Right[(i-k) % 2][a-b+n]++;
}
int ans = 0;
rep(i, 1, 2*n-1) ans += Left[0][i] * Right[0][2*n-i] + Left[1][i] * Right[1][2*n-i];
printf("%d", ans);
return 0;
}
return 0;
}
I2luY2x1ZGUgPGNzdGRpbz4KI2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y3N0cmluZz4KI2luY2x1ZGUgPGNtYXRoPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8ZnN0cmVhbT4KI2luY2x1ZGU8c3RkbGliLmg+CgojZGVmaW5lIHJlcCggaSwgbCwgciApIGZvciAoaW50IGkgPSBsOyBpIDw9IHI7IGkrKykKI2RlZmluZSBkb3duKCBpLCBsLCByICkgZm9yIChpbnQgaSA9IGw7IGkgPj0gcjsgaS0tKQoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBuLCBzLCBudW1bMTAwMDA5XSwgTGVmdFsyXVsyMDAwMDldLCBSaWdodFsyXVsyMDAwMDldOwoKaW50IG1haW4oKQp7CglzY2FuZigiJWQlZCIsICZuLCAmcyk7CglyZXAoaSwgMSwgbikgc2NhbmYoIiVkIiwgJm51bVtpXSk7CglyZXAoaywgMSwgbikgaWYgKG51bVtrXSA9PSBzKQoJewoJCWludCBhID0gMDsgaW50IGIgPSAwOwoJCUxlZnRbMF1bbl0gPSBSaWdodFswXVtuXSA9IDE7CgkJZG93bihpLCBrLTEsIDEpIAoJCXsKCQkJaWYgKG51bVtpXSA8IG51bVtrXSkgYSsrOyBlbHNlIGIrKzsKCQkJTGVmdFsoay1pKSAlIDJdW2EtYituXSsrOwoJCX0KCQlhID0gYiA9IDA7CgkJcmVwKGksIGsrMSwgbikgCgkJewoJCQlpZiAobnVtW2ldIDwgbnVtW2tdKSBhKys7IGVsc2UgYisrOwoJCQlSaWdodFsoaS1rKSAlIDJdW2EtYituXSsrOwoJCX0KCQlpbnQgYW5zID0gMDsKCQlyZXAoaSwgMSwgMipuLTEpIGFucyArPSBMZWZ0WzBdW2ldICogUmlnaHRbMF1bMipuLWldICsgTGVmdFsxXVtpXSAqIFJpZ2h0WzFdWzIqbi1pXTsKCQlwcmludGYoIiVkIiwgYW5zKTsKCQlyZXR1cm4gMDsKCX0KCXJldHVybiAwOwp9Cg==