#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, i, j, k;
  cin >> n >> k;
  long long a[n + 3];
  for (i = 1; i <= n; i++) cin >> a[i];
  a[0] = 0;
  sort(a, a + n + 1);
  vector<vector<long long>> dp(k + 2, vector<long long>(n + 2, 1));
  long long ans = 1;
  long long mod = 100000000;
  for (i = 1; i <= k; i++) {
    for (j = 1; j <= n; j++) {
      long long x = min(i, a[j]);
      x++;
      if (x > i)
        ans = dp[i][j - 1] % mod;
      else {
        ans = dp[i][j - 1] - dp[i - x][j - 1] + mod;
        ans %= mod;
      }
      dp[i][j] = dp[i - 1][j] % mod + ans;
      dp[i][j] %= mod;
    }
  }
  cout << ans;
  return 0;
}
