#include <bits/stdc++.h>
#ifdef __DEBUG__
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 1,-1, 1,-1};
int dy[]={0, 1, 0, -1, 1, 1,-1,-1};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);

inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const map<T, S> p) { for (auto el : p) cout << "[" << el.first << ";" << el.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const deque<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const set<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};
const ll mod = 998244353;
using modint = ModInt< mod >;


int N,S;
vector<int> A;
void input(){
    fast_io();
    cin >> N >> S;
    A = fetch_vec<int>(N);
}

int TLEsolve(){
    // vector<vector<vector<bool>>> dp(N+1,vector<vector<bool>>(N+1,vector<bool>(S+1,false)));
    sort(A.begin(),A.end());
    vector<unordered_map<int,unordered_map<int,modint>>> dp(N+1);
    dp[0][0][0] = 1;
    for (int i = 0; i < N; i++)
    {
        for(auto p:dp[i]){
            int s = p.first;
            for(auto ss:p.second){
                int j=ss.first;
                dp[i+1][s][j] += dp[i][s][j];
                if(s+A[i]<=S) dp[i+1][s+A[i]][j+1] += dp[i][s][j];
            }
        }
        dp[i].clear();
    }
    modint ans = 0;
    for(auto p:dp[N]){
        if(p.first==S){
            for(auto ss:p.second){
                    ans += modint(ss.second)*modint(2).pow(N-ss.first);
            }
        }
    }
    cout << ans << endl;
    return 0;
}

int solve(){
  vector<vector<modint>> dp(N+1,vector<modint>(S+1,0));
  // dp[i][v] iまでみて和がvである組み合わせ数.
  dp[0][0] = 1;
  for (int i = 0; i < N; i++)
  {
    for (int s = 0; s <= S; s++)
    {
      dp[i+1][s] += dp[i][s];
      if(s-A[i]>=0) dp[i+1][s] += dp[i][s-A[i]]/2;
    }
  }
  cout << dp[N][S]*modint(2).pow(N) << endl;
  return 0;
}

int main()
{
    input();
    solve();
    return 0;
}

Measured memory_bytes: 38588