#include<bits/stdc++.h>
using namespace std;
int f[25005][30][30][2],g[25005][30][30][2],id[25005][30],id2[25005][30];
int tot[25005],tot2[25005],n,k,ans,a[25005];map<int,int>mp[25005],mp2[25005];
const int mod=1000000007;
void Add(int &x,int y){x=(x+y>=mod?x+y-mod:x+y);}
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin>>n>>k;
    for(int i=1;i<=n;i++)cin>>a[i];
    f[0][1][0][0]=1;tot[0]=1;
    for(int i=1;i<=n;i++)
    {
    	for(int j=1;j<=tot[i-1];j++)
    	{
    		for(int p=0;p<=k;p++)
    		{
    			for(int q=0;q<=1;q++)
				{
    				if(!f[i-1][j][p][q])continue;
					//不干掉
					if(a[i]>=a[id[i-1][j]])//钦定多个最大值只考虑最右边的
					{
						if(!mp[i].count(i))mp[i][i]=++tot[i],id[i][tot[i]]=i;
						Add(f[i][mp[i][i]][p][q],f[i-1][j][p][q]);
					}
					else 
					{
						if(!mp[i].count(id[i-1][j]))mp[i][id[i-1][j]]=++tot[i],id[i][tot[i]]=id[i-1][j];
						Add(f[i][mp[i][id[i-1][j]]][p][(q+a[id[i-1][j]]-a[i])%2],f[i-1][j][p][q]);
					}
					//干掉
					if(!mp[i].count(id[i-1][j]))mp[i][id[i-1][j]]=++tot[i],id[i][tot[i]]=id[i-1][j];
					Add(f[i][mp[i][id[i-1][j]]][p+1][(q+a[id[i-1][j]])%2],f[i-1][j][p][q]);
				}
			}
		}
	}
	g[n+1][1][0][0]=1;tot2[n+1]=1;
	for(int i=n;i>=1;i--)
    {
    	for(int j=1;j<=tot2[i+1];j++)
    	{
    		for(int p=0;p<=k;p++)
    		{
    			for(int q=0;q<=1;q++)
				{
    				if(!g[i+1][j][p][q])continue;
					//不干掉
					if(a[i]>a[id2[i+1][j]])//钦定多个最大值只考虑最右边的 
					{
						if(!mp2[i].count(i))mp2[i][i]=++tot2[i],id2[i][tot2[i]]=i;
						Add(g[i][mp2[i][i]][p][q],g[i+1][j][p][q]);
					}
					else 
					{
						if(!mp2[i].count(id2[i+1][j]))mp2[i][id2[i+1][j]]=++tot2[i],id2[i][tot2[i]]=id2[i+1][j];
						Add(g[i][mp2[i][id2[i+1][j]]][p][(q+a[id2[i+1][j]]-a[i])%2],g[i+1][j][p][q]);
					}
					//干掉
					if(!mp2[i].count(id2[i+1][j]))mp2[i][id2[i+1][j]]=++tot2[i],id2[i][tot2[i]]=id2[i+1][j];
					Add(g[i][mp2[i][id2[i+1][j]]][p+1][(q+a[id2[i+1][j]])%2],g[i+1][j][p][q]);
				}
			}
		}
	}
	for(int i=1;i<=n;i++)
	{
		if(!mp[i][i]||!mp2[i][i])continue;
		int x=mp[i][i],y=mp2[i][i];
		for(int j=0;j<=k;j++)
		{
			for(int p=0;p<2;p++)
			{
				Add(ans,1ll*f[i][x][j][p]*g[i][y][k-j][(2-p)%2]%mod);
			}
		}
	}
	cout<<ans;
	return 0;
}