#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
vector<int> a;
int main()
{
int n,m,y;
cin>>n>>m;
for(int i=0;i<n;i++) cin>>y,a.push_back(y);
sort(a.begin(),a.end());
for(auto it=a.begin();it<a.end();it++)
{
int x=m-*it;
if(*(lower_bound(a.begin(),it-1,x))==x||*(lower_bound(it+1,a.end(),x))==x)
{
cout<<*it<<" "<<x<<endl;
return 0;
}
}
cout<<"No Solution"<<endl;
return 0;
}