#include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

// modint
#define mod 1000000007
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 300005
#define inf 0x3f3f3f3f

int n,k,m,o[maxn];

struct node{
	int mn,mx,s;
	node(int X=0,int Y=0,int Z=0){mn=X,mx=Y,s=Z;}
	void operator +=(node b){
		if(!b.s)return;
		if(!s)return (*this)=b,void();
		if(mx>b.mn) puts("0"),exit(0);
		mx=b.mx,s+=b.s; 
	}
}a[maxn];

modint f[5005],g[5005];

signed main()
{
	n=read(),k=read();
	For(i,1,n)o[i]=read();
	int mx=0;
	For(i,1,n){
		if(o[i]>mx) mx=o[i],a[++m]=node(o[i],o[i],1),a[++m]=node(0,0,0);
		else a[m]+=node(o[i],o[i],1); 
	}
	for(int i=m-3;i>=1;i-=2){
		if(a[i+3].s&&a[i].mx>a[i+3].mn)
			a[i]+=a[i+2],a[i+1]+=a[i+3],a[i+2].s=a[i+3].s=0;
	}
	f[0]=1;
	for(int i=1;i<=m;i+=2){
		if(!a[i].s&&!a[i+1].s)continue;
		For(j,0,n) if(f[j].x) g[j+a[i].s]+=f[j],g[j+a[i+1].s]+=f[j];
		For(j,0,n) f[j]=g[j],g[j]=0;
	}
	modint res=0;
	For(i,0,n) if(i<=k&&n-i<=k) res+=f[i];
	cout<<res.x;
	return 0;
}