#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>

using namespace std;

int main(){

  int n,s;
  cin >> n >> s;

  int a[n];
  for(int i=0;i<n;i++)cin >> a[i];

  long long int dp[n+1][s+1];
  memset(dp,0,sizeof(dp));
  long long int m=998244353;
  dp[0][0]=1;


  for(int i=0;i<n;i++){
    for(int j=0;j<s+1;j++){
      dp[i+1][j] = (dp[i+1][j] + 2*dp[i][j])%m;
      if(j-a[i]>=0)dp[i+1][j]=(dp[i+1][j]+dp[i][j-a[i]])%m;
    }
  }

  cout << dp[n][s] << endl;

}