#include <stdio.h>

#define Mod 998244353

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

int main()
{
	int i, N, S, A[3001];
	scanf("%d %d", &N, &S);
	for (i = 1; i <= N; i++) scanf("%d", &(A[i]));
	
	int j;
	long long pow[3001], pow_inv[3001], dp[2][3001];
	for (i = 1, pow[0] = 1; i <= N; i++) pow[i] = pow[i-1] * 2 % Mod;
	for (i = N - 1, pow_inv[N] = div_mod(1, pow[N], Mod); i >= 0; i--) pow_inv[i] = pow_inv[i+1] * 2 % Mod;
	for (i = 1, dp[0][0] = 1; i <= N; i++) {
		for (j = 0; j <= S; j++) dp[i%2][j] = dp[1-i%2][j];
		for (j = S - A[i]; j >= 0; j--) dp[i%2][j+A[i]] = (dp[i%2][j+A[i]] + dp[1-i%2][j] * pow_inv[1]) % Mod;
	}
	printf("%lld\n", dp[1-i%2][S] * pow[N] % Mod);
	fflush(stdout);
	return 0;
}