3852：Even For Ever

Hollywood is making a big film these days.It tells a story about the fight between Kongfu Panda and Police Black Cat.Each of them needs to release n bombs during the fight.Kongfu Panda will release n bombs a1,a2,...,an, one at each time.And each time,the product of Panda's bomb and Cat's bomb shoule be 1.This is what they call as Fight Principle.For the Kongfu Panda,the sum of all its bombs' values will be an integer s,which will be given in the input data.But for Police Black Cat,you know ,because his price is a bit lower,the sum of his bombs' values will be 1.
Now as the audiences' wish,you should figure out one possible solution of their bombs' value.

First an integer m,the number of test cases.Then an integer s,as described above.(1<=s<=100000).
Notice that all the n integers will be positive.

The answer of every case should be in one line.If there's no such an answer,output -1,else first gives n,then n integers,from a1 to an.