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.io.*;
import java.util.*;

public class Q4 {

	static Scanner sc =new Scanner(System.in);
	static BufferedWriter bw =new BufferedWriter(new OutputStreamWriter(System.out));
	
	public static void main(String[] args) throws IOException {
		int t = sc.nextInt();
		while(t-->0) {
			solve();
		}
		bw.close();
	}
	
	public static void solve() throws IOException {
		
		int n = sc.nextInt();
		int k = sc.nextInt();
		
		int p = k - 3;
		for(int i = 0;i < p;i++)bw.write("1 ");
		
		n -= p;
		
		//n is odd
				if(n % 2 == 1) {
					n--;
					bw.write("1 ");
					int c = n/2;
					bw.write(String.valueOf(c) +" " + String.valueOf(c) + "\n");
					bw.flush();
					return;
				}
				
				//n is of the form 4n
				if(n % 4 == 0) {
					
					int c = n/2;
					bw.write(String.valueOf(c) + " ");
					c = c/2;
					bw.write(String.valueOf(c)+ " " + String.valueOf(c) + "\n");
					bw.flush();
					return;
					
				}
				
				//n is of the form 4n + 2
				
				bw.write("2 ");
				n -= 2;
				n = n/2;
				bw.write(String.valueOf(n) + " " + String.valueOf(n) +"\n");
				bw.flush();

	}
}
