#include<iostream>
#include<cstring>
#include<vector>
#include<numeric>
#include<map>
#include<algorithm>
using namespace std;
using LL = long long;
LL dp[1 << 13][13][501];

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    pair<int, int> mx{0, 0};
    for(int i = 0; i < n; i++){
        mx = max(mx, make_pair(a[i], -i));
    }
    for(int i = 0; i < n; i++){
        int need = mx.first - a[i] + (i > -mx.second);
        if (need * n <= m){
            dp[1 << i][i][need * n] = 1;
        }
    }

    for(int i = 1; i + 1 < 1 << n; i++){
        int c = __builtin_popcount(i);
        for(int j = 0; j < n; j++){
            for(int k = 0; k <= m; k++){
                if (dp[i][j][k] == 0) continue;
                for(int t = 0; t < n; t++){
                    if (i >> t & 1) continue;
                    if (k + (n - c) * max(0, a[j] - a[t] + (j < t)) <= m){
                        dp[i | (1 << t)][t][k + (n - c) * max(0, a[j] - a[t] + (j < t))] += dp[i][j][k];
                    }
                }
            }
        }
    }
    LL ans = 0;
    for(int i = 0; i < n; i++){
        for(int j = 0; j <= m; j++){
            ans += dp[(1 << n) - 1][i][j];
        }
    }
    cout << ans << '\n';

}