On the board, Bob wrote n positive integers in [base](https://en.wikipedia.org/wiki/Positional_notation#Base_of_the_numeral_system) 10 with sum s (i. e. in decimal numeral system). Alice sees the board, but accidentally interprets the numbers on the board as base-11 integers and adds them up (in base 11).

What numbers should Bob write on the board, so Alice's sum is as large as possible?

Input

The input consists of multiple test cases. The first line contains an integer t (1 ≤ t ≤ 100) — the number of test cases. The description of the test cases follows.

The only line of each test case contains two integers s and n (1 ≤ s ≤ 10^9; 1 ≤ n ≤ min(100, s)) — the sum and amount of numbers on the board, respectively. Numbers s and n are given in decimal notation (base 10).

Output

For each test case, output n positive integers — the numbers Bob should write on the board, so Alice's sum is as large as possible. If there are multiple answers, print any of them.

Example

Input


6
97 2
17 1
111 4
100 2
10 9
999999 3


Output


70 27 
17 
3 4 100 4
10 90
1 1 2 1 1 1 1 1 1 
999900 90 9

Note

In the first test case, 70_{10} + 27_{10} = 97_{10}, and Alice's sum is $$$70_{11} + 27_{11} = 97_{11} = 9 ⋅ 11 + 7 = 106_{10}. (Here x_b represents the number x in base b.) It can be shown that it is impossible for Alice to get a larger sum than 106_{10}$$$.

In the second test case, Bob can only write a single number on the board, so he must write 17.

In the third test case, 3_{10} + 4_{10} + 100_{10} + 4_{10} = 111_{10}, and Alice's sum is $$$3_{11} + 4_{11} + 100_{11} + 4_{11} = 110_{11} = 1 ⋅ 11^2 + 1 ⋅ 11 = 132_{10}. It can be shown that it is impossible for Alice to get a larger sum than 132_{10}$$$.
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;

public class Practice {
	public static long mod = (long) Math.pow(10, 9) + 7;
//	public static long mod2 = 998244353;
//	public static int tt = 1;
	public static ArrayList<Long> one;
	public static ArrayList<Long> two;
//	public static long[] fac = new long[200005];
//	public static long[] invfac = new long[200005];

	public static void main(String[] args) throws Exception {
		PrintWriter pw = new PrintWriter(System.out);
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int t = Integer.parseInt(br.readLine());

		while (t-- > 0) {
			String[] s1 = br.readLine().split(" ");
			String str = s1[0];
			int num = Integer.valueOf(str);
			int[] noo = new int[str.length()];
			for (int i = 0; i < str.length(); i++) {
				noo[i] = Integer.valueOf(str.charAt(i) + "");
			}
			int n = Integer.valueOf(s1[1]);
			int cu = 0;
			int[][] arr = new int[str.length()][n];
			// System.out.println(Integer.valueOf(""));

			for (int i = 0; i < str.length(); i++) {
				cu += noo[i];
			}
			// noo=new int[str.length()];
			if (cu < n) {
				int diff = n - cu;
			//	System.out.println(diff);
				while (diff > 0) {
					for (int i = str.length() - 2; i >= 0; i--) {
						if (noo[i] > 0) {
							noo[i]--;
							noo[i + 1] += 10;
							diff -= 9;
							break;
						}
					}
				}
			}
//			for (int i = 0; i < noo.length; i++) {
//				System.out.print(noo[i] + " ");
//			}
//			System.out.println();
			// System.out.println("*********");

			//int pre = 0;
			int cc = 0;
			for (int i = 0; i < str.length(); i++) {
				if (noo[i] + cc <= n) {
					while (cc < n && noo[i] > 0) {
						arr[i][cc] = 1;
						cc++;
						noo[i]--;
					}
				} else if (cc <= n) {
					int cur = noo[i] ;
					while (cc < n && cur > 0) {
						arr[i][cc] = 1;
						cc++;
						cur--;
					}
					for (int j = 0; j < n; j++) {
						int curr = 9 - arr[i][j];
						int giv = Math.min(curr, cur);
						cur -= giv;
						arr[i][j] += giv;
					}
					
				} else {
					int cur = noo[i] ;
					for (int j = 0; j < n; j++) {
						int curr = 9 - arr[i][j];
						int giv = Math.min(curr, cur);
						cur -= giv;
						arr[i][j] += giv;
					}
					
				}
				
			}
			long aa = 0;
			StringBuilder ans = new StringBuilder();
			for (int i = 0; i < n; i++) {
				int b = 0;
				for (int j = 0; j < str.length(); j++) {
					b = b * 10 + arr[j][i];
				}
				aa += b;
				ans.append(b + " ");
				// System.out.println();
			}
			// System.out.println(aa);
			pw.println(ans.toString());

		}

		pw.close();
	}

//
//	private static long power(long a, long p) {
//		// TODO Auto-generated method stub
//		long res = 1;
//		while (p > 0) {
//			if (p % 2 == 1) {
//				res = (res * a) % mod;
//			}
//			p = p / 2;
//			a = (a * a) % mod;
//		}
//		return res;
//	}

// private static int kmp(String str) {
//		// TODO Auto-generated method stub
//		// System.out.println(str);
//		int[] pi = new int[str.length()];
//		pi[0] = 0;
//		for (int i = 1; i < str.length(); i++) {
//			int j = pi[i - 1];
//			while (j > 0 && str.charAt(i) != str.charAt(j)) {
//				j = pi[j - 1];
//			}
//			if (str.charAt(j) == str.charAt(i)) {
//				j++;
//			}
//			pi[i] = j;
//			System.out.print(pi[i]);
//		}
//		System.out.println();
//		return pi[str.length() - 1];
//	}

}

//	private static void getFac(long n, PrintWriter pw) {
//		// TODO Auto-generated method stub
//		int a = 0;
//		while (n % 2 == 0) {
//			a++;
//			n = n / 2;
//		}
//		if (n == 1) {
//			a--;
//		}
//		for (int i = 3; i <= Math.sqrt(n); i += 2) {
//			while (n % i == 0) {
//				n = n / i;
//				a++;
//			}
//		}
//		if (n > 1) {
//			a++;
//		}
//		if (a % 2 == 0) {
//			pw.println("Bob");
//		} else {
//			pw.println("Alice");
//		}
//		//System.out.println(a);
//		return;
//	}

//	private static long power(long a, long p) {
//		// TODO Auto-generated method stub
//		long res = 1;
//		while (p > 0) {
//			if (p % 2 == 1) {
//				res = (res * a) % mod;
//			}
//			p = p / 2;
//			a = (a * a) % mod;
//		}
//		return res;
//	}
//
//	private static void fac() {
//		fac[0] = 1;
//		// TODO Auto-generated method stub
//		for (int i = 1; i < fac.length; i++) {
//			if (i == 1) {
//				fac[i] = 1;
//			} else {
//				fac[i] = i * fac[i - 1];
//			}
//			if (fac[i] > mod) {
//				fac[i] = fac[i] % mod;
//			}
//		}
//	}
//
//	private static int getLower(Long long1, Long[] st) {
//		// TODO Auto-generated method stub
//		int left = 0, right = st.length - 1;
//		int ans = -1;
//		while (left <= right) {
//			int mid = (left + right) / 2;
//			if (st[mid] <= long1) {
//				ans = mid;
//				left = mid + 1;
//			} else {
//				right = mid - 1;
//			}
//		}
//		return ans;
//	}

//private static long getGCD(long l, long m) {
//
//	long t1 = Math.min(l, m);
//	long t2 = Math.max(l, m);
//	if (t1 == 0) {
//		return t2;
//	}
//	while (true) {
//		long temp = t2 % t1;
//		if (temp == 0) {
//			return t1;
//		}
//		t2 = t1;
//		t1 = temp;
//	}
//}