using System; using System.IO; using System.Text; using System.Linq; using System.Diagnostics; using System.Collections.Generic; using Enu = System.Linq.Enumerable; class Program { static readonly long Mod = 1234567891; void Add(ref long a, long b) { if ((a += b) >= Mod) a -= Mod; } void Solve() { int N = reader.Int(); long M = reader.Long(); var A = reader.IntArray(N); int Asum = A.Sum(); var dp = new long[Asum * 2 + 1]; dp[0] = 1; for (; M > 0; M >>= 1) { for (int i = 0; i < N; i++) for (int x = Asum * 2 - A[i]; x >= 0; x--) Add(ref dp[x + A[i]], dp[x]); for (int i = 0; i < Asum; i++) dp[i] = dp[i * 2 + M % 2]; Array.Clear(dp, Asum, dp.Length - Asum); } Console.WriteLine(dp[0]); } static void Main() { new Program().Solve(); } Reader reader = new Reader(Console.In); class Reader { private readonly TextReader reader; private readonly char[] separator = { ' ' }; private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries; private string[] A = new string[0]; private int i; public Reader(TextReader r) { reader = r; } public bool HasNext() { return Enqueue(); } public string String() { return Dequeue(); } public int Int() { return int.Parse(Dequeue()); } public long Long() { return long.Parse(Dequeue()); } public double Double() { return double.Parse(Dequeue()); } public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); } public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); } public string Line() { return reader.ReadLine().Trim(); } private string[] Split(string s) { return s.Split(separator, removeOp); } private bool Enqueue() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return Enqueue(); A = Split(line); i = 0; return true; } private string Dequeue() { Enqueue(); return A[i++]; } } }