#include <bits/stdc++.h>
using namespace std;
using Int = int_fast64_t;

template<Int Mod = 1000000007> class modint{
public:
	Int val;
	constexpr modint(const Int x = 0) : val(x % Mod) {if(val < 0) val += Mod;}
	constexpr modint operator+(const modint rhs) const {
		return modint(*this) += rhs;
	}
	constexpr modint operator-(const modint rhs) const {
		return modint(*this) -= rhs;
	}
	constexpr modint operator*(const modint rhs) const {
		return modint(*this) *= rhs;
	}
	constexpr modint operator/(const modint rhs) const {
		return modint(*this) /= rhs;
	}
	constexpr modint operator-() const {
		return modint(Mod - val);
	}
	constexpr modint &operator+=(const modint rhs){
		val += rhs.val;
		if(val >= Mod) val -= Mod;
		return *this;
	}
	constexpr modint &operator-=(const modint rhs){
		if(val < rhs.val) val += Mod;
		val -= rhs.val;
		return *this;
	}
	constexpr modint &operator*=(const modint rhs){
		val *= rhs.val;
		val %= Mod;
		return *this;
	}
	constexpr modint &operator/=(const modint rhs){
		return *this *= inv(rhs);
	}
	constexpr modint &operator++(){
		++val;
		if(val == Mod) val = 0;
		return *this;
	}
	constexpr modint &operator--(){
		--val;
		if(val == -1) val = Mod - 1;
		return *this;
	}
	constexpr modint operator<<(const Int rhs) const {
		return modint(*this) << rhs;
	}
	constexpr modint operator>>(const Int rhs) const {
		return modint(*this) >> rhs;
	}
	constexpr modint &operator<<=(const Int rhs){
		val <<= rhs;
		val %= Mod;
		return *this;
	}
	constexpr modint &operator>>=(const Int rhs){
		val >>= rhs;
		val %= Mod;
		return *this;
	}
	constexpr bool operator==(const modint rhs) const {
		return val == rhs.val;
	}
	constexpr bool operator!=(const modint rhs) const {
		return val != rhs.val;
	}
	constexpr bool operator<(const modint rhs) const {
		return val < rhs.val;
	}
	constexpr bool operator>(const modint rhs) const {
		return val > rhs.val;
	}
	constexpr bool operator<=(const modint rhs) const {
		return val <= rhs.val;
	}
	constexpr bool operator>=(const modint rhs) const {
		return val >= rhs.val;
	}
	friend ostream& operator<<(ostream& os, const modint<Mod>& m){
		return os << m.val;
	}
	friend istream& operator>>(istream& is, modint<Mod>& m){
		return is >> m.val;
	}
	static constexpr modint inv(modint m){
		Int a = m.val, b = Mod, u = 1, v = 0;
		while(b){
			Int t = a / b;
			a -= t * b;
			swap(a, b);
			u -= t * v;
			swap(u, v);
		}
		u %= Mod;
		if(u < 0) u += Mod;
		return modint(u);
	}
	constexpr operator Int() const {
		return val;
	}
};
using mint = modint<998244353>;

mint f(Int i, Int j, vector<vector<mint>> &dp, vector<vector<int>> &ch, vector<Int> &a){
//	cerr << i << " " << j << "\n";
	if(j < 0) return 0;
	if(ch[i][j] == 1) return dp[i][j];
	ch[i][j] = 1;
	dp[i][j] = f(i-1, j-a[i-1], dp, ch, a) + mint(2) * f(i-1, j, dp, ch, a);
//	cerr << dp[i][j] << "\n";
	return dp[i][j];
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	Int n, s; cin >> n >> s;
	vector<Int> a(n);
	for(auto &i:a) cin >> i;
	sort(a.begin(), a.end());
	vector<vector<mint>> dp(n+1, vector<mint>(s+1));
	dp[0][0] = mint(1);
	for(int i=1; i<=n; ++i)
		dp[i][0] = mint(2) * dp[i-1][0];
	vector<vector<int>> ch(n+1, vector<int>(s+1));
	for(int i=0; i<=n; ++i)
		ch[i][0] = 1;
	for(int j=0; j<=s; ++j)
		ch[0][j] = 1;
	cout << f(n, s, dp, ch, a) << "\n";
//	for(int i=0; i<=n; ++i)
//		for(int j=0; j<=s; ++j)
//			cout << i << " " << j << " " << dp[i][j] << "\n";
}

Measured memory_bytes: 109332