#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define M 1000000007ll
using namespace std;


bool solve(){
	int n, m;
	if(!(cin >> n >> m)) return false;
	vector<int> a(n), b(n);
	for(auto &x : a) {
		cin >> x;
		x--;
	}
	for(int i = 0; i < n; ++i)
		b[a[i]] = i;
	vector<pair<ll, ll>> t;
	vector<bool> v1(n, false), v2(n, false);
	bool can = true;

	for(int i = n-1; i >= 0; i--){
		if(v1[i]) continue;
		v1[i] = v2[b[i]] = true;
		ll c1 = 1, c2 = 0;
		int mn = INT_MAX;

		if(b[i]+1 < n && !v2[b[i]+1]) {
			mn = a[b[i]+1];
			c2++;
			v1[a[b[i]+1]] = v2[b[i]+1] = true;
			for(int s = b[i]+2; s < n && !v2[s]; ++s){
				if(a[s-1] > a[s]){
					can = false; break;
				}
				c2++;
				v1[a[s]] = v2[s] = true;
			}
		}

		for(int s = b[i]-1; s >= 0; --s){
			if(a[s] > mn) {
				c1++;
				v2[s] = v1[a[s]] = true;
			}
			else break;
		}

		t.push_back({c1,c2});
	}

	if(!can) {
		cout << 0 << '\n';
		return true;
	}

	int A = t[0].F + t[0].S;
	vector<vector<ll>> dp(m+1, vector<ll>(m+1, 0));
	dp[t[0].F][t[0].S] += 1;
	dp[t[0].S][t[0].F] += 1;

	for(int i = 1; i < t.size(); ++i){
		for(int j = 0; j <= A; ++j){

			if(t[i].F + j <= m && t[i].S + A - j <= m){
				dp[t[i].F + j][t[i].S + A - j] += dp[j][A - j];
				dp[t[i].F + j][t[i].S + A - j] %= M;
			}
			if(t[i].S + j <= m && t[i].F + A - j <= m){
				dp[t[i].S + j][t[i].F + A - j] += dp[j][A - j];
				dp[t[i].S + j][t[i].F + A - j] %= M;
			}
		}
		A += t[i].F + t[i].S;
	}
	ll ans = 0;
	for(int i = 0; i <= n; ++i){
		if(i <= m && n-i <= m) ans += dp[i][n-i];
		ans %= M;
	}
	cout << ans << '\n';
	return true;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	while(solve());
}