Scanf.scanf "%d %d" (fun n s ->
    let a = Array.init n (fun _ -> Scanf.scanf " %d" (fun a -> a)) in

    let m = 998244353 in
    let ( +@) a b = (a + b) mod m in
    let ( *@) a b = (a * b) mod m in

    let module M = Map.Make (struct type t = int let compare = compare end) in
    let dp = Array.make (s + 1) M.empty in
    let () = dp.(0) <- M.add 0 1 M.empty in

    for i = 0 to n - 1 do
        for j = s - a.(i) downto 0 do
            dp.(j + a.(i)) <-
                M.fold (fun k v acc ->
                    M.add (k + 1) (v +@ try M.find (k + 1) acc with _ -> 0) acc) dp.(j) dp.(j + a.(i))
        done
    done;
    let powmod a b =
        let rec loop r i acc =
            if i = 0 then acc else
                loop (r *@ r) (i lsr 1) (if i land 1 = 1 then acc *@ r else acc)
        in
        loop a b 1
    in
    M.fold (fun k v acc -> acc +@ v *@ powmod 2 (n - k)) dp.(s) 0 |> Printf.printf "%d\n"
)