#include <bits/stdc++.h>
using namespace std;
 
#define rep(i,j,n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(), i.rend()
#define INF 1e9
#define LINF 1e18
const int mod = 998244353;
 
typedef long long i64;
typedef pair<int, int> pi;
 
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
 
i64 gcd(i64 n, i64 m) {return (m == 0? n : gcd(m, n % m));}
i64 lcm(i64 n, i64 m) {return (n / gcd(n, m) * m);}
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n, K;
  cin >> n >> K;
  vt<int> a(n);
  rep(i, 0, n) {
    cin >> a[i];
  }

  vvt<vt<int>> dp(n + 1, vvt<int>(n + 1, vt<int>(10100, 0)));
  dp[0][0][0] = 1;
  rep(i, 0, n) {
    rep(j, 0, n) {
      rep(k, 0, 10000) {
        (dp[i + 1][j + 1][k + a[i]] += dp[i][j][k]) %= mod;
        (dp[i + 1][j][k] += dp[i][j][k]) %= mod;
      }
    }
  }

  int ans = 0;
  rep(i, 1, n + 1) {
    rep(j, 0, 10010) {
      if(j >= i * K) (ans += dp[n][i][j]) %= mod;
    }
  }
  cout << ans << endl;
}