#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<fstream>
#include<iomanip>
#include<ctime>
#include<complex>
#include<functional>
#include<climits>
#include<cassert>
#include<iterator>
#include<unordered_set>
using namespace std;
#define MAX 100002
int n;
long long int K;
int p[MAX];
long long int k[MAX];  //fac
/*get_inv*/
int a[MAX];
#define MOD 1000000007LL
long long int re = 0;
int bit[MAX];
long long int ppow(long long int i, long long int j){
	long long int res = 1LL;
	while (j){
		if (j & 1LL){
			res *= i;
			if (res >= MOD){
				res %= MOD;
			}
		}
		i *= i;
		i %= MOD;
		j >>= 1LL;
	}
	return res;
}
long long int inv[MAX];
void add(int i, int x){
	i++;
	while (i < MAX){
		bit[i] += x;
		i += i&-i;
	}
}
int sum(int i){
	int r = 0;
	i++;
	while (i){
		r += bit[i];
		i -= i&-i;
	}
	return r;
}
inline void dfs(int b){
	if (b == n){
		return;
	}
	dfs(b + 1);
	re += (long long int)(sum(a[b]));
	long long int rest = n - b;
	long long int pr = rest*(rest - 1LL);
	pr %= MOD;
	pr *= inv[rest];
	if (pr >= MOD){
		pr %= MOD;
	}
	pr *= (long long int)(a[b] - 1);
	re += pr;
	if (re >= MOD){
		re %= MOD;
	}
	add(a[b], 1);
	for (int i = a[b] -1; i >= 1; i--){
		re += (long long int)(sum(i));
		if (re >= MOD){
			re %= MOD;
		}
	}
}
long long int calc(){
	re = 0;
	memset(bit, 0, sizeof(bit));
	dfs(0);
	return re;
}
int main(){
	scanf("%d", &n);
	scanf("%lld", &K);
	for (int i = 0; i < n; i++){
		scanf("%d", &p[i]);
	}
	memset(k, -1, sizeof(k));
	k[0] = 1LL;
	for (int i = 1; i < MAX; i++){
		k[i] = k[i - 1];
		k[i] *= (long long int)(i);
		k[i] %= MOD;
	}
	long long int P2 = ppow(2, MOD - 2);
	for (int i = 2; i < MAX; i++){
		inv[i] = k[i] * P2;
		inv[i] %= MOD;
	}
	for (int i = 0; i < n; i++){
		a[i] = k[i];
	}
	long long int ANS = 0;
	calc();
	ANS += MOD - re;
	if (ANS >= MOD){
		ANS %= MOD;
	}
	bool exten = false;
	long long int ss = 1LL;
	for (int i = 1; i <= n; i++){
		ss *= (long long int)(i);
		if (ss > K){
			exten = true;
			break;
		}
	}
	if (exten){
		for (int i = n; i >= 1; i--){
			a[n - i] = i;
		}
		calc();
		
	}
	else{

	}
	return 0;
}