#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define fast()                        \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL)
#define int long long
/*
bool prime[10000001];
vector<int> sw;
set<int> p;
void Sieve()
{

    memset(prime, true, sizeof(prime));

    for (int p = 2; p * p <= 10000001; p++)
    {
        if (prime[p] == true)
        {
            for (int i = p * p; i <= 10000001; i += p)
                prime[i] = false;
        }
    }
    for(int i=2;i<=10000001;i++){
        if(prime[i]==true){
            p.insert(i);
        }
    }
    
}*/  
 void solve()
 {
    int n,k;
    cin>>n>>k;
    int res = n-(k-3);
    for(int i=0;i<k-3;i++)cout<<"1 ";
        n = res;
    int hf = n/2;
    if(n%2==0){
        if(hf%2==0)
        cout<<hf<<" "<<hf/2<<" "<<hf/2;
        else{
            cout<<hf-1<<" "<<hf-1<<" "<<"2";
        }
    }
    else{
        cout<<hf<<" "<<hf<<" "<<"1";
    }
}
signed main()
{
    fast();
    // Sieve();
    int t = 1;
        cin >> t;
    int ar = 1;
    while (ar <= t)
    {
           solve();
          cout << endl;
        ar++;
    }
    return 0;
}
