#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

int main()
{
  ll N, W;
  cin >> N >> W;
  vector<ll> A(N);
  for (ll i = 0; i < N; i++)
  {
    cin >> A.at(i);
  }

  ll pw = 1;
  for (ll i = 0; i < N; i++)
  {
    pw *= 3;
  }

  set<string> ids;
  for (ll b = 0; b < pw; b++)
  {
    ll bb = b;
    ll tmp = 0;
    string id = "";
    for (ll i = 0; i < N; i++)
    {
      if (bb % 3 != 0)
      {
        tmp += A.at(i) / (bb % 3);
        id += '1';
      }
      else
        id += '0';
      bb /= 3;
    }
    if (tmp == W && id != string(N, '0'))
      ids.emplace(id);
  }

  ll ans = ids.size();
  cout << ans << endl;
}