Given are a sequence of N positive integers A_1, A_2, \ldots, A_N and another positive integer S.
For a non-empty subset T of the set \\{1, 2, \ldots , N \\}, let us define f(T) as follows:


* f(T) is the number of different non-empty subsets \\{x_1, x_2, \ldots , x_k \\} of T such that A_{x_1}+A_{x_2}+\cdots +A_{x_k} = S.



Find the sum of f(T) over all 2^N-1 subsets T of \\{1, 2, \ldots , N \\}. Since the sum can be enormous, print it modulo 998244353.

Constraints

* All values in input are integers.
* 1 \leq N \leq 3000
* 1 \leq S \leq 3000
* 1 \leq A_i \leq 3000

Input

Input is given from Standard Input in the following format:


N S
A_1 A_2 ... A_N


Output

Print the sum of f(T) modulo 998244353.

Examples

Input

3 4
2 2 4


Output

6


Input

5 8
9 9 9 9 9


Output

0


Input

10 10
3 1 4 1 5 9 2 6 5 3


Output

3296
import java.util.*;
import java.io.*;

public class Main {

    private static final int MOD = 998244353;

    public Main(FastScanner in, PrintWriter out, int test) {
        int N = in.nextInt();
        int S = in.nextInt();
        int[] A = new int[N];
        for (int i = 0; i < N; i++) {
            A[i] = in.nextInt();
        }

        // dp[i][s] is the sum(f(T, s), T is a subset of [0:i], s is the target
        // sum)
        // int[][] dp = new int[N + 1][S + 1];
        // dp[0][0] = 1;
        int[] dp = new int[S + 1];
        dp[0] = 1;

        for (int i = 1; i <= N; i++) {
            // for (int s = 0; s <= S; s++) {
                // // for ith item, 2 choices: put into set T or not
                // dp[i][s] = 2 * dp[i - 1][s];
                // dp[i][s] %= MOD;
                // // ith item can also contribute to the sum s
                // if (A[i - 1] <= s) {
                    // dp[i][s] += dp[i - 1][s - A[i - 1]];
                    // dp[i][s] %= MOD;
                // }
            // }
            for (int s = S; s >= 0; s--) {
                // for ith item, 2 choices: put into set T or not
                dp[s] *= 2;
                dp[s] %= MOD;
                // ith item can also contribute to the sum s
                if (A[i - 1] <= s) {
                    dp[s] += dp[s - A[i - 1]];
                    dp[s] %= MOD;
                }
            }
        }

        // out.println(dp[N][S]);
        out.println(dp[S]);
    }

    private int count(int x) {
        int i = 1, sum = 0, res = 0;
        while (i + sum <= x) {
            sum += i;
            i++;
            res++;
        }
        return res;
    }

    private long pow(int x, int p) {
        long res = 1, a = x;
        while (p > 1) {
            if (p % 2 == 1)
                res = res * a % MOD;

            a = a * a % MOD;
            p /= 2;
        }
        res  = res * a % MOD;
        return res;
    }

    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        // Scanner in = new Scanner(
                // new BufferedReader(new InputStreamReader(System.in)));
        FastScanner in = new FastScanner(System.in);

        // int T = in.nextInt();
        for (int t = 1; t <= 1; t++) {
            Main sol = new Main(in, out, t);
        }

        out.close();
    }
}


class FastScanner{
    private InputStream stream;
    private byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;

    public FastScanner(InputStream stream)
    {
        this.stream = stream;
    }

    int read()
    {
        if (numChars == -1)
            throw new InputMismatchException();
        if (curChar >= numChars){
            curChar = 0;
            try{
                numChars = stream.read(buf);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            if (numChars <= 0)
                return -1;
        }
        return buf[curChar++];
    }

    boolean isSpaceChar(int c)
    {
        return c==' '||c=='\n'||c=='\r'||c=='\t'||c==-1;
    }

    boolean isEndline(int c)
    {
        return c=='\n'||c=='\r'||c==-1;
    }

    int nextInt()
    {
        return Integer.parseInt(next());
    }

    long nextLong()
    {
        return Long.parseLong(next());
    }

    double nextDouble()
    {
        return Double.parseDouble(next());
    }

    String next(){
        int c = read();
        while (isSpaceChar(c))
            c = read();
        StringBuilder res = new StringBuilder();
        do{
            res.appendCodePoint(c);
            c = read();
        }while(!isSpaceChar(c));
        return res.toString();
    }

    String nextLine(){
        int c = read();
        while (isEndline(c))
            c = read();
        StringBuilder res = new StringBuilder();
        do{
            res.appendCodePoint(c);
            c = read();
        }while(!isEndline(c));
        return res.toString();
    }
}
