MOD = 998244353

def main():
    import sys
    input = sys.stdin.read().split()
    N = int(input[0])
    M = int(input[1])
    A = list(map(int, input[2:2+N]))
    
    powM = [1] * (N + 1)
    for i in range(1, N+1):
        powM[i] = powM[i-1] * M % MOD
    
    sum_s0 = 0
    for a in A:
        cnt = max(0, M - a)
        sum_s0 = (sum_s0 + cnt * powM[N-1]) % MOD
    
    sum_swap = 0
    for j in range(N-1):
        a = A[j]
        b = A[j+1]
        
        total = 0
        for B_j in range(1, M+1):
            for B_j1 in range(1, M+1):
                original = (B_j > a) + (B_j1 > b)
                swapped = (B_j1 > a) + (B_j > b)
                delta = swapped - original
                if delta > 0:
                    total += 1
        total %= MOD
        
        cnt = total * powM[N-2] % MOD
        sum_swap = (sum_swap + cnt) % MOD
    
    ans = (sum_s0 + sum_swap) % MOD
    print(ans)

if __name__ == '__main__':
    main()