package no137;

import java.util.Scanner;

public class Main {
	public static final int MAX = 50000;
	public static final long MOD = 1234567891;
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		long m = sc.nextLong();
		int[] a = new int[n];
		for(int i=0;i<n;i++) {
			a[i] = sc.nextInt();
		}
		long[][] dp = new long[2][MAX+1];
		int now = 1;
		int bef = 0;
		dp[bef][0] = 1;
		while(m > 0) {
			for(int i=0;i<n;i++) {
				for(int j=0;j<=MAX;j++) {
					dp[now][j] = dp[bef][j];
					if (a[i] <= j) {
						dp[now][j] += dp[bef][j-a[i]];
					}
					dp[now][j] %= MOD;
				}
				now = 1 - now;
				bef = 1 - bef;
			}
			for(int i=0;i<=MAX;i++) {
				int j = (int) (i * 2 + m % 2);
				if (j <= MAX) {
					dp[bef][i] = dp[bef][j];
				}else{
					dp[bef][i] = 0;
				}
			}
			m /= 2;
		}
		System.out.println(dp[bef][0]);
	}

}