#include<bits/stdc++.h>
#define int long long
const int mod = 1000000007;
using namespace std;
int n, m, a[1005];
inline int solve(vector<int> v) {
	if (v.size() == 1 || v.size() == 0) return 1;
	vector<int> vl, vr;
	vl.clear(), vr.clear();
	int maxa = -1, maxb = 0;
	for (int i = 0; i < v.size(); i++) {
		if (v[i] > maxa) maxa = v[i], maxb = i;
	}
	int cnt = 0;
	for (int i = 0; i < maxb; i++) {
		if (v[i] + maxa <= m) cnt++;
		else vl.push_back(v[i]);
	}
	for (int i = maxb + 1; i < v.size(); i++) {
		if (v[i] + maxa <= m) cnt++;
		else vr.push_back(v[i]);
	}
	int ans = 1;
	for (int i = 1; i <= cnt; i++) {
		ans = ans * (vr.size() + vl.size() + i + 1) % mod;
	}
	ans = ans * solve(vl) % mod * solve(vr) % mod;
	return ans;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	vector<int> v;
	v.clear();
	for (int i = 1; i <= n; i++) cin >> a[i], v.push_back(a[i]);
	cout << solve(v);
}