C_XOR_factorization.cpp

#include <bits/stdc++.h>
using namespace std;
// First you make it work, then you can always make it beautiful

/*
n = 30, k = 4
optimal 15 23 27 29  not 30 30 23 9
xor req = 1 1 1 1 0


1st  2nd  3rd  4th  5th  <=  iterations

1    1    1    0    1  => 29   ptr = 3
1    1    0    1    1  => 27  ptr = 2
1    0    1    1    1  => 23  ptr = 1
0    1    1    1    1  => 15 ptr = 0

try to make loose numbers more and more 
if(n >> i & 1) {
    since k is even => k-1 place pe 1 hona chayie
    i will skip that index from which loose numbers increases
}
else {
    even 1 hone chayie so loose index par rkh skta hu only

}

*/

void solve() {
    int n, k;
    cin >> n >> k;

    vector<int> ans(k);
    if(k % 2 == 0) {
        int ptr = 0;
        for(int i=30;i>=0;i--) {
            if(n >> i & 1) {
                int leave = (ptr < k) ? ptr : 0;
                for(int j=0;j<k;j++) {
                    if(j == leave) continue;
                    ans[j] |= (1 << i);
                }
                if(ptr < k) ptr++;
            }
            else {
                int even = (ptr / 2) * 2;
                for(int j=0;j<even;j++) {
                    ans[j] |= (1 << i);
                }
            }
        }
    }
    else {
        ans.assign(k, n);
    }

    for(auto i : ans) cout << i << " ";
    cout << "\n";

}


int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int _;
    cin >> _;
    while (_-->0) {
        solve();
    }

    return 0;
}