#include <iostream>
#include <cstdio>

using namespace std;

typedef long long LL;

const int N = 13, S = 501;

int n, m, a[N];

LL f[1 << N][N][S];

int main() {
	scanf("%d%d", &n, &m);
	int mx = -2e9, t;
	for (int i = 0; i < n; i++) {
		scanf("%d", a + i);
		if (a[i] > mx) mx = a[i], t = i;
	}
	for (int i = 0; i < n; i++) {
		int b = max(0, mx - a[i] + (i > t));
		if (b * n <= m) f[1 << i][i][b * n]++;	
	}
	int T = (1 << n) - 1; 
	LL ans = 0;
	for (int s = 0; s < (1 << n); s++) {
		int cnt = 0;
		for (int i = 0; i < n; i++)
			if (s >> i & 1) cnt++;
		for (int i = 0; i < n; i++) {
			if (!(s >> i & 1)) continue;
			for (int j = 0; j <= m; j++) {
				if (!f[s][i][j]) continue;
				if (s == T) ans += f[s][i][j];
				for (int k = 0; k < n; k++) {
					if (s >> k & 1) continue;
					int t = (n - cnt) * max(0, a[i] - a[k] + (k > i));
					if (j + t <= m) {
						f[s | (1 << k)][k][j + t] += f[s][i][j];
					}
				}
			}
		}
	}
	printf("%lld\n", ans);
	return 0;
}