#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
int *num = new int[N];
for (int i = 0; i < N; i++)
{
scanf("%d",&num[i]);
}
sort(num,num+N);
int mark = N-1;
for (int i = 0; i < N; i++)
{
for (int j = mark; j >i; j--)
{
if (num[i] + num[j] == M)
{
printf("%d %d\n", num[i], num[j]);
return 0;
}
else if (num[i] + num[j] > M)
mark = j;
else if (num[i] + num[j] < M)
break;
}
}
cout << "No Solution\n";
return 0;
}
#include<algorithm>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
int *num = new int[N];
for (int i = 0; i < N; i++)
{
scanf("%d",&num[i]);
}
sort(num,num+N);
int mark = N-1;
for (int i = 0; i < N; i++)
{
for (int j = mark; j >i; j--)
{
if (num[i] + num[j] == M)
{
printf("%d %d\n", num[i], num[j]);
return 0;
}
else if (num[i] + num[j] > M)
mark = j;
else if (num[i] + num[j] < M)
break;
}
}
cout << "No Solution\n";
return 0;
}