#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")

using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

const int MOD = 999979;
const int NMAX = 500;

int N, K, sum;
int dp[NMAX * NMAX + 1];
int v[NMAX + 1];

int main() {
    fin >> N >> K;

    for(int i = 1; i <= N; i++) {
        fin >> v[i];
    }

    dp[0] = 1;

    for(int i = 1; i <= N; i++) {
        for(int j = v[i]; j <= K; j++) {
            dp[j] += dp[j - v[i]];

            if(dp[j] >= MOD) {
                dp[j] -= MOD;
            }
        }
    }

    fout << dp[K] % MOD << '\n';
    return 0;
}