#include "bits/stdc++.h"
using namespace std;
const int maxn = 3010, mod = 998244353;
int n, s, a[maxn];
long long dp[maxn][maxn];
int main()
{
	scanf("%d%d", &n, &s);
	for(int i = 1; i <= n; i++)
		scanf("%d", a + i);
	dp[0][0] = 1ll;
	for(int i = 1; i <= n; i++)
	{
		for(int j = 0; j <= s; j++)
			dp[i][j] = dp[i - 1][j] * 2ll % (long long)mod;
		for(int j = s; j >= a[i]; j--)
			dp[i][j] = (dp[i][j] + dp[i - 1][j - a[i]]) % (long long)mod;
	}
	printf("%d\n", dp[n][s]);
	return 0;
}