//qoj6143
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll f[1<<13][14][510];
int n, m, a[15], mx, sum, id;

int main(){
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; ++ i){
        scanf("%d", &a[i]);
        if(a[i] > mx){
            mx = a[i];
            id = i;
        }
        sum += a[i];
    }
    for(int i = 1; i <= n; ++ i){
        if(i <= id){
            f[1<<i-1][i][0] = 1;
        } else {
            f[1<<i-1][i][n] = 1;
        }
    }
    m -= mx * n - sum;
    if(m < 0){
        puts("0");
        return 0;
    }
    for(int i = 1; i < (1 << n); ++ i){
        int ppc = n - __builtin_popcount(i);
        for(int j = 1; j <= n; ++ j){
            if(!(i & (1 << j - 1))){
                continue;
            }
            for(int k = 0; k <= m; ++ k){
                if(!f[i][j][k]){
                    continue;
                }
                // printf("%d %d %d %lld\n", i, j, k, f[i][j][k]);
                for(int p = 1; p <= n; ++ p){
                    if(i & (1 << p - 1)){
                        continue;
                    }
                    if(a[p] <= a[j]){
                        if(p < j){
                            f[i|(1<<p-1)][p][k] += f[i][j][k];
                        } else if(k + ppc <= m){
                            f[i|(1<<p-1)][p][k+ppc] += f[i][j][k];
                        }
                    } else {
                        if(k + ppc * (a[p] - a[j]) <= m){
                            f[i|(1<<p-1)][p][k+ppc*(a[p]-a[j])] += f[i][j][k];
                        }
                    }
                }
            }
        }
    }
    ll ans = 0;
    for(int i = 1; i <= n; ++ i){
        for(int j = 0; j <= m; ++ j){
            ans += f[(1<<n)-1][i][j];
        }
    }
    printf("%lld\n", ans);
    return 0;
}