base :: Int
base = 1000000007

solve :: Int -> Int -> [Int] -> Int
solve n k a = ((((n_inv * k) `mod` base) * (k + 1)) `div` 2 -  n_ordered * k) `mod` base
--solve n k a = ((n_inv * k) `div` base) * (k + 1) --`div` 2 - n_ordered * k
--solve n k a = n_inv + n_ordered
  where
    calc _ 0 _ = (0, 0)
    calc (h:rs) x y = (a0 + b0, a1 + b1)
      where
        (a0, a1) = calc rs (x - 1) y
        (b0, b1)
          | h < y = (1, 1)
          | h > y = (1, 0)
          | True  = (0, 0)
    (n_inv, n_ordered) = foldl (\(x0, y0) (x1, y1) -> (x1 + x0, y1 + y0)) (0, 0) $ zipWith (calc a) [1 .. ] $ tail a

main :: IO ()
main = do
  n:k:_ <- fmap (\x -> read x :: Int) . words <$> getLine
  a <- fmap (\x -> read x :: Int) . words <$> getLine
  print $ solve n k a
