\begin{problem}{High Score}{standard input}{standard output}{2 seconds}{1024 megabytes}

Hermione loves to play the following computer game, in which the player controls an unordered multiset of integers. Initially, the multiset is empty and the player's score is $0$. At any moment in the game, the multiset contains at most $k$ integers (not necessarily distinct). In one turn, the player can choose one of the following moves:
\begin{itemize}
\item \textbf{Insert}. Choose an integer $2$ or $4$ and insert it into the multiset. This move does not change the score, and it is only allowed if the size of the multiset before the move is strictly less than~$k$.
\item \textbf{Merge}. Choose an integer $x$ such that the multiset contains at least two copies of $x$. Remove two copies of $x$ from the multiset, and insert one copy of $2x$ into the multiset. This move adds the value~$2x$ to the player's score.
\end{itemize}

The player can stop the game after any turn, at which point the player's score becomes final.

Hermione has been on vacation for the whole summer, and she hasn't played the game in a while. Today, she opened the game on her laptop and saw the leaderboard with the highest scores she's ever had: $h_1, h_2, \ldots, h_n$ in some order. Now she is curious how she managed to achieve those scores.

For each $h_i$, find any multiset of integers that Hermione could have at the end of the game if her final score was $h_i$, or determine that it is impossible to achieve such a score.


\InputFile
The first line contains two integers $n$ and $k$, denoting the number of scores on the leaderboard and the maximum size of the multiset ($1 \le n \le 10^4$; $2 \le k \le 16$).

Each of the next $n$ lines contains a single integer $h_i$, denoting a score on the leaderboard ($1 \le h_i \le 10^9$).


\OutputFile
For each score $h_i$, print the final size of the multiset $s$, followed by $s$ integers describing the contents of the multiset in any order ($0 \le s \le k$). It must be possible to achieve the score $h_i$ with this multiset at the end of the game. If there are multiple answers, print any of them.

If it is impossible to have the score $h_i$ at the end of the game, print a single integer $-1$ instead.

\Examples

\begin{example}
\exmpfile{example.01}{example.01.a}%
\exmpfile{example.02}{example.02.a}%
\exmpfile{example.03}{example.03.a}%
\end{example}

\Note
A possible sequence of moves for the first test is shown below:

\begin{center}
$\{\} \xrightarrow{\texttt{insert 2}} \{2\} \xrightarrow{\texttt{insert 2}} \{2, 2\} \xrightarrow[\texttt{score += 4}]{\texttt{merge, x = 2}} \{4\} \xrightarrow{\texttt{insert 4}} \{4, 4\} \xrightarrow[\texttt{score += 8}]{\texttt{merge, x = 4}} \{8\} $
\end{center}

\end{problem}

