#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 100000 + 10;
const int mod = 1e9 + 7;
int n,k,a[N],ans;
int num[10 + 10][N];
int opt[N][10 + 10];
int read(){
	char ch; int sum = 0,flag = 1;
	ch = getchar();
	while(ch < '0' || ch > '9'){if(ch == '-') flag = -flag; ch = getchar();}
	while(ch >= '0' && ch <= '9'){sum = sum * 10 + ch - '0'; ch = getchar();}
	return flag * sum;
}
int lowbit(int x){
	return x & (-x);
}
int query(int x,int id){
	int ans = 0;
	while(x){
		ans = (ans + num[id][x]) % mod;
		x -= lowbit(x);
	}
	return ans;
}
void Add(int x,int id,int val){
	while(x <= n){
		num[id][x] = (num[id][x] + val) % mod;
	    x += x & (-x); 
	}
	return ;
}
signed main(){
	n = read(); k = read();
	k++;
	for(int i = 1; i <= n; i++){
		a[i] = read();
	}
	for(int i = 1; i <= n; i++){
		opt[i][1] = 1ll;
		Add(a[i],1,1); 
		for(int j = 2; j <= k; j++){
			int tmp = query(a[i] - 1,j - 1);
			opt[i][j] += (tmp % mod);
			Add(a[i],j,opt[i][j]);
		}
	}
	for(int i = 1; i <= n; i++){
		ans = (ans % mod + opt[i][k] % mod) % mod;
	}
	printf("%lld\n",ans % mod);
	return 0;
}