description: 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}$$$.
solution: import java.util.*;
  
  import java.io.*;
  import java.math.*;
  import java.awt.geom.*;
  
  import static java.lang.Math.*;
  
  public class Solution implements Runnable {
  
  	long mod1 = (long) 1e9 + 7;
  	int mod2 = 998244353;
  
  	public void solve() throws Exception {
  		int t = sc.nextInt();
  		while (t-- > 0) {
  			int s=sc.nextInt(), n=sc.nextInt();
  			while(n>1) {
  				for(int i=(int)1e9;i>=0;i/=10) {
  					if(s-i>=n-1) {
  						s-=i;
  						n--;
  						out.print(i+" ");
  						break;
  					}
  				}
  			}
  			out.print(s+" ");
  			out.println();
  		}
  
  	}
  
  	static long gcd(long a, long b) {
  		if (a == 0)
  			return b;
  		return gcd(b % a, a);
  	}
  
  	static void sort(int[] a) {
  		ArrayList<Integer> l = new ArrayList<>();
  		for (int i : a)
  			l.add(i);
  		Collections.sort(l);
  		for (int i = 0; i < a.length; i++)
  			a[i] = l.get(i);
  	}
  
  	static long ncr(int n, int r, long p) {
  		if (r > n)
  			return 0l;
  		if (r > n - r)
  			r = n - r;
  
  		long C[] = new long[r + 1];
  
  		C[0] = 1;
  
  		for (int i = 1; i <= n; i++) {
  
  			for (int j = Math.min(i, r); j > 0; j--)
  				C[j] = (C[j] + C[j - 1]) % p;
  		}
  		return C[r] % p;
  	}
  
  	void sieveOfEratosthenes(boolean prime[], int size) {
  		for (int i = 0; i < size; i++)
  			prime[i] = true;
  
  		for (int p = 2; p * p < size; p++) {
  			if (prime[p] == true) {
  				for (int i = p * p; i < size; i += p)
  					prime[i] = false;
  			}
  		}
  	}
  
  	static int LowerBound(int a[], int x) { // smallest index having value >= x
  		int l = -1, r = a.length;
  		while (l + 1 < r) {
  			int m = (l + r) >>> 1;
  			if (a[m] >= x)
  				r = m;
  			else
  				l = m;
  		}
  		return r;
  	}
  
  	static int UpperBound(int a[], int x) {// biggest index having value <= x
  		int l = -1, r = a.length;
  		while (l + 1 < r) {
  			int m = (l + r) >>> 1;
  			if (a[m] <= x)
  				l = m;
  			else
  				r = m;
  		}
  		return l + 1;
  	}
  
  	public long power(long x, long y, long p) {
  		long res = 1;
  		// out.println(x+" "+y);
  		x = x % p;
  		if (x == 0)
  			return 0;
  
  		while (y > 0) {
  			if ((y & 1) == 1)
  				res = (res * x) % p;
  			y = y >> 1;
  			x = (x * x) % p;
  		}
  		return res;
  	}
  
  	static Throwable uncaught;
  
  	BufferedReader in;
  	FastScanner sc;
  	PrintWriter out;
  
  	@Override
  	public void run() {
  		try {
  			in = new BufferedReader(new InputStreamReader(System.in));
  			out = new PrintWriter(System.out);
  			sc = new FastScanner(in);
  			solve();
  		} catch (Throwable uncaught) {
  			Solution.uncaught = uncaught;
  		} finally {
  			out.close();
  		}
  	}
  
  	public static void main(String[] args) throws Throwable {
  		Thread thread = new Thread(null, new Solution(), "", (1 << 26));
  		thread.start();
  		thread.join();
  		if (Solution.uncaught != null) {
  			throw Solution.uncaught;
  		}
  	}
  
  }
  
  class FastScanner {
  
  	BufferedReader in;
  	StringTokenizer st;
  
  	public FastScanner(BufferedReader in) {
  		this.in = in;
  	}
  
  	public String nextToken() throws Exception {
  		while (st == null || !st.hasMoreTokens()) {
  			st = new StringTokenizer(in.readLine());
  		}
  		return st.nextToken();
  	}
  
  	public int nextInt() throws Exception {
  		return Integer.parseInt(nextToken());
  	}
  
  	public int[] readArray(int n) throws Exception {
  		int[] a = new int[n];
  		for (int i = 0; i < n; i++)
  			a[i] = nextInt();
  		return a;
  	}
  
  	public long nextLong() throws Exception {
  		return Long.parseLong(nextToken());
  	}
  
  	public double nextDouble() throws Exception {
  		return Double.parseDouble(nextToken());
  	}
  
  }