#include<bits/stdc++.h>
using namespace std;
#define mk make_pair
#define t first
int n,m,a[26001],f[26001][27][27][2],g[26001][27][27][2];
long long ans;
vector <pair<int,int>> pre[26001],suf[26001];
const int mod=1e9+7;
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	pre[0].push_back({0,0}),suf[n+1].push_back({0,n+1}),f[0][0][0][0]=g[n+1][0][0][0]=1;
	for(int i=1;i<=n;i++){
		pre[i]=pre[i-1];
        pre[i].push_back({a[i],i});
		sort(begin(pre[i]),end(pre[i]));
        reverse(begin(pre[i]),end(pre[i]));
		if(pre[i].size()>m+1) pre[i].pop_back();
        int c=0,k=0,s=0;
        for(int j=0;j<pre[i].size();j++) if(pre[i][j]==mk(a[i],i)) c=j;
        for(int j=0;j<=m;j++){
            for(int l=0;l<pre[i-1].size();l++){
                for(int r:{0,1}){
                    k=mk(a[i],i)>pre[i-1][l]?c:l,s=(pre[i][k].t-a[i])&1,(f[i][j][k][r^s]+=f[i-1][j][l][r])%=mod;
                    k=mk(a[i],i)>pre[i-1][l]?l+1:l,s=k!=pre[i].size()?pre[i][k].t&1:0,(f[i][j+1][k][r^s]+=f[i-1][j][l][r])%=mod;
                }
            }
        }
	}
	for(int i=n;i>=1;i--){
		suf[i]=suf[i+1];
        suf[i].push_back({a[i],i});
		sort(begin(suf[i]),end(suf[i]));
        reverse(begin(suf[i]),end(suf[i]));
		if(suf[i].size()>m+1) suf[i].pop_back();
        int c=0,k=0,s=0;
        for(int j=0;j<suf[i].size();j++) if(suf[i][j]==mk(a[i],i)) c=j;
        for(int j=0;j<=m;j++){
            for(int l=0;l<suf[i+1].size();l++){
                for(int r:{0,1}){
                    k=mk(a[i],i)>suf[i+1][l]?c:l,s=(suf[i][k].t-a[i])&1,(g[i][j][k][r^s]+=g[i+1][j][l][r])%=mod;
                    k=mk(a[i],i)>suf[i+1][l]?l+1:l,s=k!=suf[i].size()?suf[i][k].t&1:0,(g[i][j+1][k][r^s]+=g[i+1][j][l][r])%=mod;
                }
            }
        }
	}
    for(int i=0;i<=m;i++){
        int u=pre[n][i].second;
        for(int j=0;j<=m;j++){
            long long l0=0,l1=0,r0=0,r1=0;
            for(int l=0;l<pre[u-1].size();l++) if(mk(a[u],u)>pre[u-1][l]) (l0+=f[u-1][j][l][0])%=mod,(l1+=f[u-1][j][l][1])%=mod;
            for(int l=0;l<suf[u+1].size();l++) if(mk(a[u],u)>suf[u+1][l]) (r0+=g[u+1][m-j][l][0])%=mod,(r1+=g[u+1][m-j][l][1])%=mod;
            (ans+=l0*r0+l1*r1)%=mod;
        }
    }
    printf("%lld",ans);
	return 0;
}