#include <bits/stdc++.h>
#define int long long
#define lint long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeof(a))
#define POW(n) (1LL<<(n))
#define IN(i,a,b) (a <= i && i <= b)
using namespace std;
template <typename T> inline bool CHMIN(T& a,T b) { if(a>b) { a=b; return 1; } return 0; }
template <typename T> inline bool CHMAX(T& a,T b) { if(a<b) { a=b; return 1; } return 0; }
template <typename T> inline void SORT(T& a) { sort(ALL(a)); }
template <typename T> inline void REV(T& a) { reverse(ALL(a)); }
template <typename T> inline void UNI(T& a) { sort(ALL(a)); a.erase(unique(ALL(a)),a.end()); }
template <typename T> inline T LB(vector<T>& v, T a) { return *lower_bound(ALL(v),a); }
template <typename T> inline int LBP(vector<T>& v, T a) { return lower_bound(ALL(v),a) - v.begin(); }
template <typename T> inline T UB(vector<T>& v, T a) { return *upper_bound(ALL(v),a); }
template <typename T> inline int UBP(vector<T>& v, T a) { return upper_bound(ALL(v),a) - v.begin(); }
template <typename T1, typename T2> ostream& operator<< (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os; }
template <typename T1, typename T2> istream& operator>> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template <typename T> ostream& operator<< (ostream& os, const vector<T>& v) { REP(i,v.size()) { if (i) os << " "; os << v[i]; } return os; }
template <typename T> istream& operator>> (istream& is, vector<T>& v) { for(T& in : v) is >> in; return is; }
template <typename T = int> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...)); }
template <typename T, typename V> typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V> typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e,v); }
const lint MOD = 1000000007;
const lint INF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-10;

template <typename T>
struct BinaryIndexedTree {
    int n;
    vector<T> d;
    BinaryIndexedTree() {}
    BinaryIndexedTree(int n): n(n + 1), d(n + 1, 0) {}
    
    // 0~kまでの和を求める (0-indexed)
    T sum(int k)
    {
        T r = 0;
        for (++k; k > 0; k -= k & -k) {
            r += d[k];
        }
        return r;
    }

    // l~rまでの和を求める (0-indexed)
    T sum(int l, int r)
    {
        return sum(r) - sum(l - 1);
    }

    // k番目にxを加える (0-indexed)
    void add(int k, T x)
    {
        for (++k; k < n; k += k & -k) {
            d[k] += x;
        }
    }
};
template <typename T> using BIT = BinaryIndexedTree<T>;

int inversion_number(vector<int> a) {
    int n = a.size();
    vector<pii> b;
    for (int i = 0; i < n; i++) {
        b.emplace_back(a[i], i);
    }
    sort(b.begin(), b.end());
    for (int i = 0; i < a.size(); i++) {
        a[i] = b[i].second;
    }
    BinaryIndexedTree<int> bit(n);
    int r = 0;
    for (int i = 0; i < n; i++) {
        int s = a[i];
        r += s - bit.sum(s);
        bit.add(s, 1);
    }
    return r;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    int N, K;
    cin >> N >> K;
    vector<int> A(N);
    cin >> A;
    int ans = inversion_number(A) * K % MOD;
    vector<int> cnt(2010, 0);
    for (int a : A) cnt[a]++;
    vector<int> cum = cnt;
    for (int i = 2000; i >= 1; i--) {
        cum[i] += cum[i + 1];
    }
    for (int i = 1; i <= 2000; i++) if (cnt[i]) {
        int tmp = cum[i + 1] * cnt[i] % MOD;
        int k = K * (K - 1) / 2 % MOD;
        (tmp *= k) %= MOD;
        (ans += tmp) %= MOD;
    }
    cout << ans << endl;

    return 0;
}

Measured memory_bytes: 384