#include <bits/stdc++.h>
using namespace std;
void solve()
{
long long n, x, y, temp = 0, s = 0;
cin >> n >> x >> y;
priority_queue<long long, vector<long long>, greater<long long>> pq;
for(long long i=0; i<n; i++)
{
cin >> temp;
pq.push(temp);
}
for(long long i=0; i<y; i++)
{
s = pq.top();
pq.pop();
s = (s^x);
pq.push(s);
}
while (pq.empty() == false)
{
cout << pq.top() << " ";
pq.pop();
}
cout << "\n";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while(t--!=0)
{
solve();
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2b2lkIHNvbHZlKCkKewoJbG9uZyBsb25nIG4sIHgsIHksIHRlbXAgPSAwLCBzID0gMDsKCWNpbiA+PiBuID4+IHggPj4geTsKCXByaW9yaXR5X3F1ZXVlPGxvbmcgbG9uZywgdmVjdG9yPGxvbmcgbG9uZz4sIGdyZWF0ZXI8bG9uZyBsb25nPj4gcHE7Cglmb3IobG9uZyBsb25nIGk9MDsgaTxuOyBpKyspCgl7CgkJY2luID4+IHRlbXA7CgkJcHEucHVzaCh0ZW1wKTsKCX0KCWZvcihsb25nIGxvbmcgaT0wOyBpPHk7IGkrKykKCXsKCQlzID0gcHEudG9wKCk7CgkJcHEucG9wKCk7CgkJcyA9IChzXngpOwoJCXBxLnB1c2gocyk7Cgl9Cgl3aGlsZSAocHEuZW1wdHkoKSA9PSBmYWxzZSkKICAgIHsKICAgICAgICBjb3V0IDw8IHBxLnRvcCgpIDw8ICIgIjsKICAgICAgICBwcS5wb3AoKTsKICAgIH0KICAgIGNvdXQgPDwgIlxuIjsKfQoKaW50IG1haW4oKSB7Cglpb3M6OnN5bmNfd2l0aF9zdGRpbygwKTsKCWNpbi50aWUoMCk7Cgljb3V0LnRpZSgwKTsKCWxvbmcgbG9uZyB0OwoJY2luID4+IHQ7Cgl3aGlsZSh0LS0hPTApCgl7CgkJc29sdmUoKTsKCX0KCXJldHVybiAwOwp9