output_description: Print the inversion number of B, modulo 10^9 + 7.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
      A_0 A_1 ... A_{N - 1}
attempt: # https://atcoder.jp/contests/jsc2019-qual/tasks/jsc2019_qual_b
  # B - Kleene Inversion
  
  import math
  
  n, k = list(map(int, input().split()))
  a_list = list(map(int, input().split()))
  
  w = (10**9) + 7
  unit_c = 0
  
  # 1個の中だと
  for i, a in enumerate(a_list[:-1]):
      unit_c += len([x for x in a_list[i:] if x < a])
  
  appendix = 0
  # print(a_list[-1], a_list[0])
  if len(a_list) > 1:
      for a in a_list:
          # 自分より小さいやつの数
          appendix += len([x for x in a_list if x < a])
  
  # 2回以上繰り返す場合
  # print('unit_c: {}'.format(unit_c))
  # print('appendix: {}'.format(appendix))
  
  # total_tento_1 = unit_c * (k-1)
  if k - 1 == 1:
      work = 1
  elif (k - 1) % 2 == 0:
      work = (1 + (k - 1)) * ((k - 1) / 2)
  else:
      mid_index = math.floor((k - 1) / 2) + 1
      work = (1 + (k - 1)) * math.floor((k - 1) / 2)
      work += mid_index
  
  t_1 = (unit_c * k) % w
  t_21 = appendix % w
  t_22 = work % w
  t_2 = (t_21 * t_22) % w
  ans = int((t_1 + t_2) % w)
  
  # ans = ((unit_c * k) + (appendix * work)) % w
  # total_amari = int(total_tento % w)
  print(ans)
  
problem_description: Statement
  
  We have a sequence of N integers A~=~A_0,~A_1,~...,~A_{N - 1}.
  
  Let B be a sequence of K \times N integers obtained by concatenating K copies
  of A. For example, if A~=~1,~3,~2 and K~=~2, B~=~1,~3,~2,~1,~3,~2.
  
  Find the inversion number of B, modulo 10^9 + 7.
  
  Here the inversion number of B is defined as the number of ordered pairs of
  integers (i,~j)~(0 \leq i < j \leq K \times N - 1) such that B_i > B_j.
samples: [{"input": "2 2\n    2 1", "output": "3\n    \n\nIn this case, B~=~2,~1,~2,~1. We have:\n\n  * B_0 > B_1\n  * B_0 > B_3\n  * B_2 > B_3\n\nThus, the inversion number of B is 3.\n\n* * *"}, {"input": "3 5\n    1 1 1", "output": "0\n    \n\nA may contain multiple occurrences of the same number.\n\n* * *"}, {"input": "10 998244353\n    10 9 8 7 5 6 3 4 2 1", "output": "185297239\n    \n\nBe sure to print the output modulo 10^9 + 7."}]