It is the hard version of the problem. The only difference is that in this version 3 ≤ k ≤ n.

You are given a positive integer n. Find k positive integers a_1, a_2, …, a_k, such that:

  * a_1 + a_2 + … + a_k = n 
  * LCM(a_1, a_2, …, a_k) ≤ n/2 



Here LCM is the [least common multiple](https://en.wikipedia.org/wiki/Least_common_multiple) of numbers a_1, a_2, …, a_k.

We can show that for given constraints the answer always exists.

Input

The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.

The only line of each test case contains two integers n, k (3 ≤ n ≤ 10^9, 3 ≤ k ≤ n).

It is guaranteed that the sum of k over all test cases does not exceed 10^5.

Output

For each test case print k positive integers a_1, a_2, …, a_k, for which all conditions are satisfied.

Example

Input


2
6 4
9 5


Output


1 2 2 1 
1 3 3 1 1 
import sys
def get_ints(): return list(map(int, sys.stdin.readline().strip().split()))

testcases = int(input())
for testcase in range(testcases):
    temparr = get_ints()
    a = temparr[0]
    b = temparr[1]
    ans = []
    if b > 3 :
        diff = b - 3 
        for i in range(diff):
            a -= 1 
            ans.append(str(1))

    if a & 1 :
        ans.append(str(1))
        a -= 1 
        diff = a >> 1
        ans.append( str(diff) )
        ans.append(str(diff))
        print(" ".join(ans))
    else:
        diff = a >> 1 
        if diff & 1 :
            ans.append(str(2))
            ans.append(str(diff - 1))
            ans.append(str(diff - 1))
            print(" ".join(ans))
        else:
            halfhalf = diff >> 1 
            ans.append(str(diff))
            ans.append(str(halfhalf))
            ans.append(str(halfhalf))
            print(" ".join(ans))
    
            
            
            
        
        
        
            
            
            