Construct Array with Divisible Sum

Given two integers N and K, construct an array of N positive integers such that each integer is between 1 and $10^{18}$ (inclusive) and the sum of the array is divisible by K.

You are guaranteed that such an array always exists. For multiple test cases, perform the operation for each test case.

Note: You may output any valid array that meets the conditions.

inputFormat

The first line contains an integer T, the number of test cases. Each of the following T lines contains two integers: N and K, where N is the length of the array to construct, and K is the divisor for the sum.

outputFormat

For each test case, output a single line containing N space-separated integers that form an array. The sum of the array must be divisible by K. If there are multiple valid solutions, you may output any one.

## sample

1
3 5

1 1 3

</p>