//For higher stack size use g++ -O2 -std=c++11 -Wall -Wl,--stack=268435456 a.cpp -o a.exe in cmd
    #include <bits/stdc++.h>
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    #include <cstring>
    #include <chrono>
    #include <complex>
    #define ll long long
    #define ld long double
    #define vi vector<int>
    #define vll vector<ll>
    #define vvi vector < vi >
    #define pii pair<int,int>
    #define pll pair<long long, long long>
    #define mod 1000000007
    #define inf 1000000000000000001;
    #define all(c) c.begin(),c.end()
    #define mp(x,y) make_pair(x,y)
    #define mem(a,val) memset(a,val,sizeof(a))
    #define eb emplace_back
    #define pb push_back
    #define f first
    #define s second

    using namespace std;
    int main()
    {
        std::ios::sync_with_stdio(false);
        int T;
        cin>>T;
        // cin.ignore(); must be there when using getline(cin, s)
        while(T--)
        {
            int n,k,i,j;
            cin>>n>>k;
            set<pii> st;
            int ar[n+1],ar2[n+1];
            for(i=1;i<=n;++i)
            {
                cin>>ar[i];
            }
            for(i=1;i<=k;++i)
            {
                ar2[i]=ar[i];
                st.insert({ar2[i],i});
            }
            for(i=k+1;i<=n;++i)
            {
                auto it=st.begin();
                ar2[i]=(*it).f^ar[i];
                st.erase(it);
                st.insert({ar2[i],i});
            }
            vector<pii> v;
            for(auto it:st)
            {
                v.pb({it.s,it.f});
            }
            sort(v.begin(),v.end());
            for(auto it:v)
                cout<<it.s<<" ";
            cout<<endl;
        }
        return 0;
    }