cf 1312 D 逆元模板

Your task is to calculate the number of arrays such that: each array contains n elements; each element is an integer from 1 to m; for each array, there is exactly one pair of equal elements; for each array a, there exists an index i such that the array is strictly ascending before the i-th element a