#include #define rep(i,a,b) for(int i=(a);i<=(b);++i) #define per(i,a,b) for(int i=(a);i>=(b);--i) #define pii pair #define vi vector #define fi first #define se second #define pb push_back #define ALL(x) x.begin(),x.end() #define sz(x) int(x.size()) #define ll long long using namespace std; const int N = 2e5 + 5,P = 1234567891; int sum[105],a[105],n; ll dp[N]; ll m; void upd(ll &x,const ll y){x = (x + y) % P;} int main(){ cin.tie(0)->sync_with_stdio(0); cin >> n >> m; rep(i,1,n)cin >> a[i]; rep(i,1,n)sum[i] = sum[i - 1] + a[i]; dp[0] = 1; while(m){ rep(i,sum[n],2 * sum[n] + 5)dp[i] = 0; rep(i,1,n)per(k,sum[n] + sum[i],a[i]){ upd(dp[k],dp[k - a[i]]); } rep(k,0,sum[n])dp[k] = dp[2 * k + m % 2]; m /= 2; } cout << dp[0] << endl; return 0; }