Chef and Subsequences

Chef has a sequence $A$ of $N$ integers such that $|A_i| \leq 1$. For each $x$ such that $-N \leq x \leq N$, find the number of non-empty subsequences of $A$ whose sum of elements is $x$. Since that answer may be too large, print this modulo $163,577,857$. ###Input: - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cas