BZOJ 1303

//By SiriusRen
#include <cstdio>
using namespace std;
const int N=200500;
int n,b,sum[N],p,a[N],cnt[N];
long long ans;
int main(){
    scanf("%d%d",&n,&b);
    sum[0]=n;
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        if(a[i]>b)sum[i]=sum[i-1]+1;
        else if(a[i]<b)sum[i]=sum[i-1]-1;
        else sum[i]=sum[i-1],p=i;
    }
    for(int i=p;i<=n;i++)cnt[sum[i]]++;
    for(int i=0;i<p;i++)ans+=cnt[sum[i]];
    printf("%lld\n",ans);
}