#include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
ll x,n;

ll eq1(ll i){
    return ceil((x-i+1)/(2.0*(n-1)));
}
ll eq2(ll i){
    return ceil((x-(2*n-1-i))/(2.0*(n-1)));
}

int main(){
    
    ll t;  cin>>t;
    while(t--){
        cin>>x>>n;
        
        if(n==1) cout<<x<<endl;
        else {
            cout<<eq1(1)<<" ";
            
            for(ll i=2;i<n;i++)
                cout<<eq1(i)+eq2(i)<<" ";
                
            cout<<eq1(n)<<endl;
        }
        
    }
    
    return 0;
}