#include <bits/stdc++.h>
using namespace std;
void solve(){
int n, k;
cin >> n >> k;
vector<int> arr(n);
for(int i = 0; i < n; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
int maxSum = 0;
int l = 0, r = n-1, pivot;
for(int i = 0; i < n; i++){
l = 0;
r = n-1;
while(l < r){
pivot = (l+r)/2;
long long power = pow(arr[i], arr[pivot]);
cout << arr[i] <<" "<<arr[pivot]<<" "<< power<< endl;
if(power == k && arr[i] != arr[pivot]){
if(arr[i] + arr[pivot] > n)
break;
maxSum = max(maxSum, arr[pivot]+arr[i]);
break;
}
if(power <= k)
l = pivot+1;
if(power > k)
r = pivot-1;
}
}
cout << "\n" << maxSum << endl;
}
int main(){
int t; cin >> t;
while(t--)
solve();
return 0;
}
Copy