#include <bits/stdc++.h>
using namespace std;
bool comp(pair<int,int>a,pair<int,int>b)
{
return (a.first-a.second)<(b.first-b.second);
}
int main()
{
int test;
cin>>test;
do
{
int n;
cin>>n;
vectorv;
vector<pair<int,int>> ans;
v.reserve(n);
for(int i=0;i<n;i++)
{
int temp;
cin>>temp;
v.push_back(temp);
}
int m;
cin>>m;
cin.get();
auto it=v.begin();
while(it!=v.end())
{
if(binary_search(v.begin(),v.end(),(m-(*it))))
ans.push_back(make_pair(*it,m-(*it)));
it++;
}
sort(ans.begin(),ans.end(),comp);
auto j=ans.begin();
cout<<"Deepak should buy roses whose prices are "<<(*j).first<< " and "<<(*j).second<<endl;
}while(test--);
}