#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

// Declaring ordered_set for pair<int,int>
typedef tree<pair<int, int>, null_type, 
less<pair<int, int>>, rb_tree_tag, 
tree_order_statistics_node_update> os;

#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);

typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;


void solve() {
        
        int n , m , c ;
        cin >> n >> m >> c ;
        
        vector <int> a(n + 1) ;
        for(int i = 1 ; i <= n ; i ++) cin >> a[i] ;
        os cur ;
        vector <int> atm(n + 2) , atc(n + 2) ;
        map <int , int> mp ;
        vector <int> eqm(n + 2) , eqc(n + 2) ;
        for(int i = 1 ; i <= n + 1 ; i ++) {
          eqm[i] = (mp.count(m) ? mp[m] : 0) ;
          eqc[i] = (mp.count(c) ? mp[c] : 0) ;
          if(i <= n) mp[a[i]] ++ ;
        }
        for(int i = 1 ; i <= n + 1 ; i ++) {
          int all = i - 1 ;
          int less = cur.order_of_key({m , -1}) ;
          int gre = all - less - eqm[i] ;
          atm[i] = less - gre ;
          less = cur.order_of_key({c , -1}) ;
          gre = all - less - eqc[i] ;
          atc[i] = less - gre ;
          if(i <= n) cur.insert({a[i] , i}) ;
         
        }
       
        
        ll ans = 0 ;
      
        os small , gre ;
        for(int j = 1 ; j <= n + 1 ; j ++) {
          int sc = atc[j] ;
          if(m < c) sc ++ ;
          else if(m > c) sc -- ;
          gre.insert({sc , j}) ;
          
        }
        for(int i = 1 ; i <= n + 1 ; i ++) {
          int sm = atm[i] ;
          int sc = atc[i] ;
          
          if(m > c) sm ++ ;
          else if(m < c) sm -- ;
          small.insert({atc[i] , i}) ;
        
          ans += small.order_of_key({sm , -1}) ;
          if(m > c) sm -- ;
          else if(m < c) sm ++ ; 
          ans += gre.order_of_key({sm , -1}) ;
          sc = atc[i] ;
          if(m < c) sc ++ ;
          else if(m > c) sc -- ;
          
          gre.erase({sc , i}) ;
          
        }
        cout << ans << endl ;
        
}




int main() {

    fastio();
    int t{1};
  //  cin >> t;
    while (t--) {
        solve();
    }

}

...