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: /*
      Author : Akshat Jindal
      from NIT Jalandhar , Punjab , India
      JAI MATA DI
   */
  import java.util.*;
  
  
  import java.io.*;
  import java.math.*;
  import java.sql.Array;
  
  
  
  public class Main {
  	  static class FR{
  		  
  			BufferedReader br;
  			StringTokenizer st;
  			public FR() {
  				br = new BufferedReader(new InputStreamReader(System.in));
  			}
  			String next() 
  		    { 
  		        while (st == null || !st.hasMoreElements()) 
  		        { 
  		            try
  		            { 
  		                st = new StringTokenizer(br.readLine()); 
  		            } 
  		            catch (IOException  e) 
  		            { 
  		                e.printStackTrace(); 
  		            } 
  		        } 
  		        return st.nextToken(); 
  		    } 
  
  		    int nextInt() 
  		    { 
  		        return Integer.parseInt(next()); 
  		    } 
  
  		    long nextLong() 
  		    { 
  		        return Long.parseLong(next()); 
  		    } 
  
  		    double nextDouble() 
  		    { 
  		        return Double.parseDouble(next()); 
  		    } 
  
  		    String nextLine() 
  		    { 
  		        String str = ""; 
  		        try
  		        { 
  		            str = br.readLine(); 
  		        } 
  		        catch (IOException e) 
  		        { 
  		            e.printStackTrace(); 
  		        } 
  		        return str; 
  		    } 
  		}
  	 
  	  static long mod = (long)(1e9 + 7);
  	 
  	static void sort(long[] arr ) {
  		 ArrayList<Long> al = new ArrayList<>();
  		 for(long e:arr) al.add(e);
  		 Collections.sort(al);
  		 for(int i = 0 ; i<al.size(); i++) arr[i] = al.get(i);
  	 }
  	static void sort(int[] arr ) {
  		 ArrayList<Integer> al = new ArrayList<>();
  		 for(int e:arr) al.add(e);
  		 Collections.sort(al);
  		 for(int i = 0 ; i<al.size(); i++) arr[i] = al.get(i);
  	 }
  	static int UB(long[] arr , long find , int l , int r) {
  		while(l<=r) {
  			int m = (l+r)/2;
  			if(arr[m]<find) l = m+1;
  			else r = m-1;
  		}
  		return l;
  	}
  	static int LB(long[] arr , long find,int l ,int r ) {
  		while(l<=r) {
  			int m = (l+r)/2;
  			if(arr[m] > find) r = m-1;
  			else l = m+1;
  		}
  		return r;
  	}
  	static int UB(int[] arr , long find , int l , int r) {
  		while(l<=r) {
  			int m = (l+r)/2;
  			if(arr[m]<find) l = m+1;
  			else r = m-1;
  		}
  		return l;
  	}
  	static int LB(int[] arr , long find,int l ,int r ) {
  		while(l<=r) {
  			int m = (l+r)/2;
  			if(arr[m] > find) r = m-1;
  			else l = m+1;
  		}
  		return r;
  	}
  	 static long gcd(long a, long b)
  	  {      
  	     if (b == 0)
  	        return a;
  	     return gcd(b, a % b); 
  	  }
  	 static boolean[] prime(int num) {
  			boolean[] bool = new boolean[num];
  		     
  		      for (int i = 0; i< bool.length; i++) {
  		         bool[i] = true;
  		      }
  		      for (int i = 2; i< Math.sqrt(num); i++) {
  		         if(bool[i] == true) {
  		            for(int j = (i*i); j<num; j = j+i) {
  		               bool[j] = false;
  		            }
  		         }
  		      }
  		      if(num >= 0) {
  		    	  bool[0] = false;
  		    	  bool[1] = false;
  		      }
  		      
  		      return bool;
  		}
  	 static void sort(char[] arr) {
  		 ArrayList<Character> al = new ArrayList<Character>();
  		 for(char cc:arr) al.add(cc);
  		 Collections.sort(al);
  		 for(int i = 0 ;i<arr.length ;i++) arr[i] = al.get(i);
  		 
  	 }
  	 static long[][] ncr(int n, int k)
  	    {
  	        long C[][] = new long[n + 1][k + 1];
  	        int i, j;
  	 
  	        // Calculate  value of Binomial
  	        // Coefficient in bottom up manner
  	        for (i = 0; i <= n; i++) {
  	            for (j = 0; j <= Math.min(i, k); j++) {
  	                // Base Cases
  	                if (j == 0 || j == i)
  	                    C[i][j] = 1;
  	 
  	                // Calculate value using
  	                // previously stored values
  	                else
  	                    C[i][j] = (C[i - 1][j - 1] + C[i - 1][j])%mod;
  	            }
  	        }
  	 
  	        return C;
  	    }
  	 static long modInverse(long a, long m)
  	    {
  	        long g = gcd(a, m);
  	       
  	          return   power(a, m - 2, m);
  	        
  	    }
  	   
  	      static long power(long x, long y, long m)
  	    {
  	        if (y == 0)
  	            return 1;
  	        long p = power(x, y / 2, m) % m;
  	        p = (int)((p * (long)p) % m);
  	        if (y % 2 == 0)
  	            return p;
  	        else
  	            return (int)((x * (long)p) % m);
  	    }
  	      static class DisjointUnionSets {
  			    int[] rank, parent;
  			    int n;
  			  
  			    public DisjointUnionSets(int n)
  			    {
  			        rank = new int[n];
  			        parent = new int[n];
  			        this.n = n;
  			        makeSet();
  			    }
  			  
  			    void makeSet()
  			    {
  			        for (int i = 0; i < n; i++) {
  			          
  			            parent[i] = i;
  			        }
  			    }
  			  
  			    int find(int x)
  			    {
  			        if (parent[x] != x) {
  			        
  			            parent[x] = find(parent[x]);
  			  
  			        }
  			  
  			        return parent[x];
  			    }
  			  
  			    void union(int x, int y)
  			    {
  			        int xRoot = find(x), yRoot = find(y);
  			  
  			        if (xRoot == yRoot)
  			            return;
  			  
  			        if (rank[xRoot] < rank[yRoot])
  			  
  			            parent[xRoot] = yRoot;
  			  
  			        else if (rank[yRoot] < rank[xRoot])
  			  
  			            parent[yRoot] = xRoot;
  			  
  			        else
  			        {
  			            parent[yRoot] = xRoot;
  			  
  			            rank[xRoot] = rank[xRoot] + 1;
  			        }
  			    }
  			}
  	      
  /************************************************ Query **************************************************************************************/	  
  	      static class SparseTable{
  	    		
  	    		private long[][] st;
  	    		
  	    		SparseTable(long[] arr){
  	    			int n = arr.length;
  	    			st = new long[n][25];
  	    			log = new int[n+2];
  	    			build_log(n+1);
  	    			build(arr);
  	    		}
  	    		
  	    		private void build(long[] arr) {
  	    			int n = arr.length;
  	    			
  	    			for(int i = n-1 ; i>=0 ; i--) {
  	    				for(int j = 0 ; j<25 ; j++) {
  	    					int r = i + (1<<j)-1;
  	    					if(r>=n) break;
  	    					if(j == 0 ) st[i][j] = arr[i];
  	    					else st[i][j] = Math.min(st[i][j-1] , st[ i + ( 1 << (j-1) ) ][ j-1 ] );
  	    				}
  	    			}
  	    		}
  	    		public long gcd(long a  ,long b) {
  	    			if(a == 0) return b;
  	    			return gcd(b%a , a);
  	    		}
  	    		public long query(int l ,int r) {
  	    			int w = r-l+1;
  	    			int power = log[w];
  	    			return Math.min(st[l][power],st[r - (1<<power) + 1][power]);
  	    		}
  	    		private int[] log;
  	    		void build_log(int n) {
  	    			log[1] = 0;
  	    			for(int i = 2 ; i<=n ; i++) {
  	    				log[i] = 1 + log[i/2];
  	    			}
  	    		}
  	    	}
  //	  	static int query(int[] tree , int ss ,int se ,int qs , int qe,int index) {
  //			
  //			if(ss>=qs && se<=qe) return tree[index];
  //			
  //			if(qe<ss || se<qs) return Integer.MAX_VALUE;
  //			
  //			int mid = (ss + se)/2;
  //			int left = query(tree , ss , mid , qs ,qe , 2*index);
  //			int right= query(tree ,mid + 1 , se , qs ,qe , 2*index+1);
  //			return Math.min(left, right);
  //		}
  //		static void buildTree(int[] a ,int s ,int e ,int[] tree ,int index ) {
  //			if(s == e) {
  //				tree[index] = a[s];
  //				return;
  //			}
  //		
  //			int mid = (s+e)/2;
  //			
  //			buildTree(a, s,  mid, tree, 2*index);
  //			buildTree(a, mid+1, e, tree, 2*index+1);
  //			
  //			tree[index] = tree[2*index] + tree[2*index+1];
  //		}
  	  
  /* ***************************************************************************************************************************************************/	 
  	 
  	      static FR sc = new FR();
  	 static StringBuilder sb = new StringBuilder();
  	 public static void main(String args[]) throws IOException {
  	
  		 int tc = 1;
  		  tc = sc.nextInt();
  
  		 while(tc-->0) {
  			 TEST_CASE();
  			 
  		 }
  		 System.out.println(sb);
  	 }
  	 
  	 static void TEST_CASE() {
  		 
  		 long s = sc.nextInt();
  		 int n = sc.nextInt();
  		 long[] ans = new long[n];
  		 for(int i =0 ; i<n ; i++) {
  //			 for(long e:ans) System.out.print(e+" ");
  //			 System.out.println();
  			String str = ""+s;
  			int j = str.length() - 1;
  			long num = 1;
  			if(i == n-1) {
  				if(s!=0) {
  					ans[i] = s;
  					continue;
  				}
  			}
  			while(j>=0) {
  				if(str.charAt(j) != '0') {
  					break;
  				}
  				j--;
  				num *= 10;
  			}
  			if(j>=0) {
  				ans[i] = num;
  				s -= num;
  			}else {
  //				System.out.println(i+"\n");
  				j = 0;
  				int ind = -1;
  				while(j<i) {
  					if(!cond(ans[j])) {
  						ind = j;
  						break;
  					}
  					if(ans[j]>=10 && (ind == -1 || ans[ind]>ans[j] )) {
  						ind = j;
  					}
  					j++;
  				}
  				if(ind!=-1) {
  					
  					 num = 10;
  					while(ans[ind]%num == 0) num *= 10;
  					num /= 10;
  					if(cond(ans[ind])) {
  //						System.out.println("yes");
  						num /= 10;
  					}
  					ans[ind] -= num;
  					ans[i] = num;
  				}else {
  					j = 0;
  					ind = -1;
  					while(j<i) {
  						if((ind == -1 || ans[ind]<ans[j] )) {
  							ind = j;
  						}
  						j++;
  					}
  					ans[ind]--;
  					ans[i]++;
  				}
  			}
  		 }
  		 for(long e:ans) sb.append(e+" ");
  		 sb.append("\n");
  		 
  	 }
  	 static boolean cond(long num) {
  		 while(num%10 == 0) {
  			 num /= 10;
  		 }
  		 return num == 1;
  	 }
  }
  
  
  
  /*******************************************************************************************************************************************************/
  
  /***
   
   
  */
  
  
  