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 java.util.Scanner;
public class Main
{
	public static void main(String[] args) {
		Scanner input=new Scanner(System.in);
		int t;
		t=input.nextInt();
		while(t>0)
		{
		    int n,k;
		    n=input.nextInt();
		    k=input.nextInt();
		    
		    int ex=k-3;
		    n-=(ex);
		    
		    for(int i=0;i<ex;i++)
		    System.out.print("1 ");
		    
		    if(n%2==1)
		    {
		        System.out.println("1 "+n/2+" "+n/2);
		    }
		    else
		    {
		        int a,b,c;
		        b=(n-2)/2;
		        c=n/2;
		        a=n/4;
		        if(n%4!=0)
		        System.out.println("2 "+b+" "+" "+b);
		        else
		        System.out.println(c+" "+a+" "+a);
		        
		    }
		    t--;
		}
	}
}
