#include <cstdio>

 #include <cstring>

 #include <algorithm>

 const int maxm =  + ;

 const int inf = 0x7fffffff >> ;

 int dp[maxm];

 int n, m;

 int x;

 int main () {

     scanf("%d %d", &n, &m);

     for (int i = ; i <= m; i++) dp[i] = inf;

     dp[] = ;

     for (int i = ; i <= n; i++) {

         scanf("%d", &x);

         for (int j = m; j >= x; j--) {

             if (dp[j - x] == inf) continue;

             if (dp[j] == inf) dp[j] = dp[j-x];

             else dp[j] += dp[j-x];

         }

     }

     if (dp[m] == inf) printf("");

     else printf("%d", dp[m]);

     return ;

 }