// 都什么年代了还 g++5 啊？？？？？？
#include <bits/stdc++.h>
using namespace std;
#define For(Ti,Ta,Tb) for(auto Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(auto Ti=(Ta);Ti>=(Tb);--Ti)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
using ll=long long;
const int N=2.5e4+5,K=27,Mod=1e9+7;
using Info=array<array<int,2>,K>;
int n,k,h[N],id[N],h_[N];
Info dp(const vector<int>& hs,int k){
	Info f[2][K]{};
	int par=0;
	f[0][0][0][0]=1;
	vector<int> vec;
	auto get=[&](int x){
		return lower_bound(range(vec),x,greater<int>())-vec.begin()+1;
	};
	for(int x:hs){
		static int real[K],nxt[K];
		real[0]=0;
		For(i,1,min(int(vec.size()),k+1)){
			real[i]=vec[i-1];
		}
		vec.insert(vec.begin()+(get(x)-1),x);
		For(i,1,min(int(vec.size())-1,k+1)){
			nxt[i]=get(real[i]);
		}
		int getx=get(x);
		For(a,0,k+1){
			For(b,0,k){
				For(c,0,1){
					ll F=f[par][a][b][c];
					if(!F) continue;
					if(b<k&&x){
						(f[par^1][nxt[a]][b+1][c^(real[a]&1)]+=F)%=Mod;
					}
					(f[par^1][real[a]>=x?nxt[a]:getx][b][c^(max(real[a]-x,0)&1)]+=F)%=Mod;
				}
			}
		}
		memset(f[par],0,sizeof(f[par]));
		par^=1;
	}
	Info ans{};
	For(a,0,k+1){
		For(b,0,k){
			For(c,0,1){
				(ans[b][c]+=f[par][a][b][c])%=Mod;
			}
		}
	}
	return ans;
}
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>k;
	For(i,1,n){
		cin>>h[i];
		h_[i]=h[i];
		id[i]=i;
	}
	sort(id+1,id+n+1,[](int i,int j){
		return h[i]>h[j];
	});
	ll ans=0;
	For(i,1,k+1){
		For(j,1,i-1) h[id[j]]=0;
		vector<int> v1,v2;
		For(j,1,id[i]-1){
			v1.push_back(h[j]);
		}
		Dec(j,n,id[i]+1){
			v2.push_back(h[j]);
		}
		auto f1=dp(v1,k-i+1),f2=dp(v2,k-i+1);
		For(b,0,k-i+1){
			For(c,0,1){
				(ans+=1LL*f1[b][c]*f2[k-i+1-b][c])%=Mod;
			}
		}
		For(j,1,n) h[j]=h_[j];
	}
	cout<<ans<<'\n';
	return 0;
}