---

import sys

def solve():
    input_data = sys.stdin.read().split()
    if not input_data:
        return
    
    N = int(input_data[0])
    M = int(input_data[1])
    X = int(input_data[2])
    
    if X < 1 or X > M:
        print("NotCorrectColor")
        return
        
    A = [int(x) for x in input_data[3:3+N]]
    
    pos = []
    for i in range(N):
        if A[i] == X:
            pos.append(i)
            
    if not pos:
        print(0)
        return
        
    total_ways = 0
    
    for i in range(len(pos)):
        current_p = pos[i]
        
        prev_p = pos[i-1] if i > 0 else -1
        
        next_p = pos[i+1] if i + 1 < len(pos) else N
        
        left_options = current_p - prev_p
        
        right_options = next_p - current_p
        
        total_ways += left_options * right_options
        
    print(total_ways)

if __name__ == '__main__':
    solve()