func_code_string: #include<bits/stdc++.h>   using namespace std;      #define FASTio ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);   #define ll long long int    #define all(v) (v).begin(), (v).end()   #define mp make_pair   #define pb push_back   #define pf push_front   #define ff first   #define ss second   #define lcm(a, b) ((a) * (b)) / __gcd(a, b)   #define umpit unordered_map<ll,ll>::iterator   #define mpit map<ll,ll>::iterator   #define setit set<ll>::iterator   #define mx(a) *max_element(all(a))   #define mn(a) *min_element(all(a))   #define yes cout<< YES n    #define no cout<< NO n    const ll INF = LLONG_MAX / 2;   #define PI 3.1415926535897932384626433832795   #define mod 1000000007      ll bin_exp_mod(ll a,ll n)   {       ll res=1;       a%=mod;       if(a==0)           return 0;       while(n)       {           if(n&1)               res=((res%mod)*(a%mod))%mod;           n=n>>1;           a=((a%mod)*(a%mod))%mod;       }       res%=mod;       return res;   }         int main()   {      FASTio;       #ifndef ONLINE_JUDGE                    //file start       freopen( input.txt , r ,stdin);       freopen( output.txt , w ,stdout);          #endif                                  //file end       ll t,i,j;       cin>>t;       while(t--)       {           ll n,k;           cin>>n>>k;           while(k>3)           {               cout<< 1  ;               k--;               n--;           }           vector<ll>arr(k);           if(n%3 == 0)           {                              arr[0] = n/3;               arr[1] = n/3;               arr[2] = n/3;               for(auto x : arr)                   cout<<x<<   ;               cout<<  n ;               continue;           }           if(n%4 == 0)           {              arr[0] = n/2;               arr[1] = n/4;               arr[2] = n/4;               for(auto x : arr)                   cout<<x<<   ;               cout<<  n ;               continue;           }           if(n%2 == 0)           {                arr[0] = n/2 -1;               arr[1] = n/2 - 1;               arr[2] = 2;               for(auto x : arr)                   cout<<x<<   ;               cout<<  n ;               continue;           }           if(n%2 == 1)           {                arr[0] = n/2;               arr[1] = n/2;               arr[2] = 1;               for(auto x : arr)                   cout<<x<<   ;               cout<<  n ;               continue;           }       }       return 0;   }