Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int, input().split())
A = list(map(int, input().split()))
minA = min(A)

count1 = 0
for i in range(N):
    for j in range(i + 1, N):
        if A[i] == minA:
            continue
        if A[i] > A[j]:
            count1 += 1

A2 = A + A[::]
# count2 = 0
# for i in range(N * 2):
#     for j in range(i + 1, N * 2):
#         if A2[i] > A2[j]:
#             count2 += 1

count2 = count1
for i in range(N):
    for j in range(i + 1, N * 2):
        if A2[i] == minA:
            continue
        if A2[i] > A2[j]:
            count2 += 1

A3 = A + A[::] + A[::]
# count3 = 0
# for i in range(N * 3):
#     for j in range(i + 1, N * 3):
#         if A3[i] > A3[j]:
#             count3 += 1

count3 = count2
for i in range(N):
    for j in range(i + 1, N * 3):
        if A3[i] == minA:
            continue
        if A3[i] > A3[j]:
            count3 += 1

diff1 = count2 - count1
diff2 = count3 - count2
diffx = diff2 - diff1

bn_last = diff1 + diffx * (K - 2)
bn_sum = ((diff1 + bn_last) * (K - 1)) // 2
an_sum = count1 + bn_sum

if K == 1:
    print(count1)
elif K == 2:
    print(count2)
else:
    print(an_sum % ((10 ** 9) + 7))


Fixed submission:
N, K = map(int, input().split())
A = list(map(int, input().split()))

count1 = 0
for i in range(N):
    for j in range(i + 1, N):
        if A[i] > A[j]:
            count1 += 1

count2 = 0
for i in range(N):
    for j in range(N):
        if A[i] > A[j]:
            count2 += 1

# print(count1)
# print(count2)

ans = K * count1 + (count2 * K * (K - 1)) // 2
ans = ans % ((10 ** 9) + 7)
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int, input().split())
A = list(map(int, input().split()))

count1 = 0
for i in range(N):
    for j in range(i + 1, N):
        if A[i] > A[j]:
            count1 += 1

A2 = A + A[::]
# count2 = 0
# for i in range(N * 2):
#     for j in range(i + 1, N * 2):
#         if A2[i] > A2[j]:
#             count2 += 1

count2 = count1
for i in range(N):
    for j in range(i + 1, N * 2):
        if A2[i] > A2[j]:
            count2 += 1


A3 = A + A[::] + A[::]
# count3 = 0
# for i in range(N * 3):
#     for j in range(i + 1, N * 3):
#         if A3[i] > A3[j]:
#             count3 += 1

count3 = count2
for i in range(N):
    for j in range(i + 1, N * 3):
        if A3[i] > A3[j]:
            count3 += 1

diff1 = count2 - count1
diff2 = count3 - count2
diffx = diff2 - diff1

bn_last = diff1 + diffx * (K - 2)
bn_sum = ((diff1 + bn_last) * (K - 1)) // 2
an_sum = count1 + bn_sum

if K == 1:
    print(count1)
elif K == 2:
    print(count2)
else:
    print(an_sum % ((10 ** 9) + 7))


Fixed submission:
N, K = map(int, input().split())
A = list(map(int, input().split()))

count1 = 0
for i in range(N):
    for j in range(i + 1, N):
        if A[i] > A[j]:
            count1 += 1

count2 = 0
for i in range(N):
    for j in range(N):
        if A[i] > A[j]:
            count2 += 1

# print(count1)
# print(count2)

ans = K * count1 + (count2 * K * (K - 1)) // 2
ans = ans % ((10 ** 9) + 7)
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int, input().split())
A = list(map(int, input().split()))

count1 = 0
for i in range(N):
    for j in range(i + 1, N):
        # print(i, j)
        if A[i] > A[j]:
            # print(A[i], A[j])
            count1 += 1
# print(count1)

A2 = A + A[::]
count2 = 0
for i in range(N * 2):
    for j in range(i + 1, N * 2):
        # print(i, j)
        if A2[i] > A2[j]:
            # print(A[i], A[j])
            count2 += 1
# print(count2)

A3 = A + A[::] + A[::]
count3 = 0
for i in range(N * 3):
    for j in range(i + 1, N * 3):
        if A3[i] > A3[j]:
            count3 += 1
# print(count3)

diff1 = count2 - count1
diff2 = count3 - count2
diffx = diff2 - diff1

bn_last = diff1 + diffx * (K - 2)
# print(bn_last)
bn_sum = ((diff1 + bn_last) * (K - 1)) // 2
# print(bn_sum)
an_sum = count1 + bn_sum

if K == 1:
    print(count1)
elif K == 2:
    print(count2)
else:
    print(an_sum % ((10 ** 9) + 7))


Fixed submission:
N, K = map(int, input().split())
A = list(map(int, input().split()))

count1 = 0
for i in range(N):
    for j in range(i + 1, N):
        if A[i] > A[j]:
            count1 += 1

count2 = 0
for i in range(N):
    for j in range(N):
        if A[i] > A[j]:
            count2 += 1

# print(count1)
# print(count2)

ans = K * count1 + (count2 * K * (K - 1)) // 2
ans = ans % ((10 ** 9) + 7)
print(ans)