#include <bits/stdc++.h>

#define R register
#define ll long long
#define sum(a, b) (((a) + (b)))
#define Add(a, b) ((a) = sum(a, b))
#define meow(cat...) fprintf(stderr, cat)

const ll MaxN = 13;
const ll MaxM = 5e2 + 10;

ll f[1 << MaxN | 1][MaxN + 1][MaxM];
ll n, m, lim, max, a[MaxN + 1], num[1 << MaxN | 1];

int lowbit(int x) { return x & (-x); }

inline ll read()
{
    ll x = 0;
    char ch = getchar();
    while(ch > '9' || ch < '0')
        ch = getchar();
    while(ch <= '9' && ch >= '0') 
        x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
    return x;
}

signed main()
{   
	n = read(), m = read();
	lim = (1 << n) - 1, a[0] = -1;
	for(ll i = 1; i <= n; i++)
	{
		a[i] = read(), num[1 << i - 1] = i;
		if(a[i] > a[max]) max = i;
	}
	for(ll i = 1; i <= n; i++)
	{
		ll val = n * (a[max] - a[i] + (max < i));
		if(val <= m) f[1 << (i - 1)][i][val] = 1;
	}
	for(int s = 1; s < lim; s++)
	{
		int pop = __builtin_popcount(s);
		for(int t = s; t; t -= lowbit(t))
			for(int sum = 0; sum <= m; sum++)
			{
				int pos = num[lowbit(t)];
				for(int i = 1; i <= n; i++)
					if(!(s & (1 << (i - 1))))
					{
						int val = sum + (n - pop) * std::max(0ll, (pos < i) + a[pos] - a[i]);
						if(val <= m) Add(f[s | (1 << (i - 1))][i][val], f[s][pos][sum]);
					}
			}
	}
	ll ans = 0;
	for(int i = 1; i <= n; i++)
		for(int j = 0; j <= m; j++)
			Add(ans, f[lim][i][j]);
	printf("%lld\n", ans);
    return 0;
}