#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
ll n, s, a[3001], dp[3000][6100][3];
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cin >> n >> s;
  for (int i = 0; i < (n); i++) cin >> a[i];
  for (int i = 0; i < (n); i++) {
    dp[i][0][0] = 1;
    for (int j = 3000; j >= 0; j--) {
      dp[i + 1][j + a[i]][1] += dp[i][j][0];
      dp[i + 1][j + a[i]][1] %= 998244353;
      dp[i + 1][j][1] += dp[i][j][0];
      dp[i + 1][j][1] %= 998244353;
      dp[i + 1][j + a[i]][1] += dp[i][j][1];
      dp[i + 1][j + a[i]][1] %= 998244353;
      dp[i + 1][j][1] += dp[i][j][1];
      dp[i + 1][j][1] %= 998244353;
      dp[i + 1][j + a[i]][2] += dp[i][j][0];
      dp[i + 1][j + a[i]][2] %= 998244353;
      dp[i + 1][j][2] += dp[i][j][0];
      dp[i + 1][j][2] %= 998244353;
      dp[i + 1][j + a[i]][2] += dp[i][j][1];
      dp[i + 1][j + a[i]][2] %= 998244353;
      dp[i + 1][j][2] += dp[i][j][1];
      dp[i + 1][j][2] %= 998244353;
      dp[i + 1][j][2] += dp[i][j][2];
      dp[i + 1][j][2] %= 998244353;
    }
  }
  cout << dp[n][s][2] << endl;
  return 0;
}
