#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<ctype.h>
#include<algorithm>
#include<vector>
#include<stack>
using namespace std;
#pragma comment(linker,"/STACK:102400000,102400000")
#define pi acos(-1.0)
#define eps 1e-7
#define MOD 1000000007
#define INF 0x3f3f3f3f
typedef long long LL;
const int N=40005;
int numo[100005],nume[100005];
int a[40005];
int main(void)
{
    int i,n,m,sum,cnt,t;
    while(scanf("%d%d",&n,&m)!=EOF) 
    {
        for(i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            if(a[i]==m)
                t=i;
        }
        sum=cnt=0;
        for(i=t-1;i>=0;i--)
        {
            if (a[i]>m)
                cnt++;
            else
                cnt--;
            if(cnt==0&&!((t-i)&1))
                sum++;
        }
        memset(numo,0,sizeof(numo));
        memset(nume,0,sizeof(nume));
        cnt=0;
        for(i=t+1;i<n;i++) 
        {
            if(a[i]>m)
                cnt++;
            else
                cnt--;
            if((i-t)&1)
                numo[cnt+N]++;
            else
                nume[cnt+N]++;
        }
        cnt=0;
        for(i=t-1;i>=0;i--) 
        {
            if(a[i]>m)
                cnt++;
            else
                cnt--;
            if((t-i)&1)
                sum+=numo[-cnt+N];
            else
                sum+=nume[-cnt+N];
        }
        printf("%d\n",sum+nume[N]+1);
    }
    return 0;
}