#include<iostream>
#include<map>
using namespace std;
int main(){
int n,m,temp;
cin>>n>>m;
map<int,int>mapp;
for(int i=0;i<n;i++){
scanf("%d",&temp);
mapp[temp]++; //key为硬币面额,value为数量
}
int flag=0;
for(auto it=mapp.begin();it!=mapp.end();it++){ //map中键自动排序(红黑树)
int t1=it->first,t2=m-t1;
it->second--; //t1数值的硬币数量--
if(mapp[t2]!=0) {
cout<<t1<<" "<<t2;
flag=1;
break;
}
}
if(flag==0)cout<<"No Solution";
system("pasue");
return 0;
}