#include <iostream>

using namespace std;
typedef long long ll;
ll mod = 1234567891,dp[200010],a[110];
int main(){
    ll i,j,n,m; cin >> n >> m;
    for(i=0;i<n;i++) cin >> a[i];
    dp[0] = 1;
    int sum = 0;
    for(i=0;i<n;i++) sum += a[i];
    while(m){
        for(i=0;i<n;i++){
            for(j=2*sum;j>=a[i];j--){
                (dp[j] += dp[j - a[i]]) %= mod;
            }
        }
        for(j=0;j<=2*sum;j++){
            ll nx = 2*j + (m&1);
            if(nx<=2*sum) dp[j] = dp[nx];
            else dp[j] = 0;
        }
        m /= 2;
        // for(j=0;j<=sum;j++) cout << dp[j] << " ";
        // cout << "\n";
    }
    cout << dp[0] << "\n";
}