#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN=15;
const int MAXM=503;
const int MAXV=1e4+3;
const int MAXS=1<<13;
int n,m,a[MAXN],cnt[MAXN][MAXM],mx;
vector<int> lft,rhs;
inline ll solve()
{
    for(int i=0;i<=n;i++)
        fill_n(cnt[i],m+1,0);
    do
    {
        int used=0;
        for(int i=1;i<rhs.size();i++)
        {
            used+=(rhs.size()-i)*max(0,a[rhs[i-1]]-a[rhs[i]]
                +(rhs[i-1]<rhs[i]));
            if(used>m) break;
        }
        if(used<=m) ++cnt[rhs.front()][used];
    } while(next_permutation(rhs.begin(),rhs.end()));
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            cnt[i][j]+=cnt[i][j-1];
    ll res=0;
    do
    {
        int used=(a[mx]-a[lft.front()]+(mx<lft.front()))*n;
        for(int i=1;i<lft.size();i++)
        {
            used+=(n-i)*max(0,a[lft[i-1]]-a[lft[i]]
                +(lft[i-1]<lft[i]));
            if(used>m) break;
        }
        if(used>m) continue;
        for(int i:rhs)
        {
            int now=used+(n-lft.size())*
                max(0,a[lft.back()]-a[i]+(lft.back()<i));
            if(now<=m) res+=cnt[i][m-now];
        }
    } while(next_permutation(lft.begin(),lft.end()));
    return res;
}
inline ll enumerate()
{
    ll res=0;
    for(int i=1;i<1<<n;i++)
        if(__builtin_popcount(i)==(n>>1))
        {
            lft.clear(),rhs.clear();
            for(int j=0;j<n;j++)
                if(i>>j&1) lft.push_back(j+1);
                else rhs.push_back(j+1);
            res+=solve();
        }
    return res;
}
int main()
{
    scanf("%d%d",&n,&m);
    if(n==1) return putchar('1'),0;
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    for(int i=1;i<=n;i++)
        if(a[mx]<a[i]||(a[mx]==a[i]&&i<mx)) mx=i;
    printf("%lld",enumerate());
    return 0;
}