/*
author: x+b(国外)
*/

#include<bits/stdc++.h>
#define MOD 1000000007
#define N 100005
#define LL long long
using namespace std;

LL n,k,ans;
LL t[N],a[N],dp[N][15],tree[N][15];

LL lowbit(LL a){return a&(-a);}

void add(int t,int p,LL val)
{
	for(int i=t;i<=n;i+=lowbit(i))
		tree[i][p]=(tree[i][p]+val)%MOD;
}

LL sum(int t,int p)
{
	LL res=0;
	for(int i=t;i;i-=lowbit(i))
		res=(res+tree[i][p])%MOD;
	return res;
}

struct node
{
	int id;
	LL val;
}e[N];

bool cmp(node a,node b)
{
	if(a.val==b.val) return a.id>b.id;
	return a.val<b.val;
}

int main()
{
	scanf("%lld%lld",&n,&k);
	for(int i=1;i<=n;i++)
		scanf("%lld",&a[i]),dp[i][1]=1,e[i]={i,a[i]};
	k++;
	sort(e+1,e+n+1,cmp);
	for(int i=1;i<=n;i++)
		t[i]=e[i].id;
	for(int p=2;p<=k;p++){
		for(int i=1;i<=n;i++){
			dp[t[i]][p]=sum(t[i]-1,p-1)%MOD;
			add(t[i],p-1,dp[t[i]][p-1]);
		}
	}
	for(int i=1;i<=n;i++)
		ans=(ans+dp[i][k])%MOD;
	printf("%lld",ans%MOD);
}