#include <bits/stdc++.h> using namespace std; int main() { int lst[10005]; int N,L; cin >> N >> L; for(int i = 1;i <= N;i++) { cin >> lst[i]; } sort(lst + 1,lst + 1 + N); int minn = 114514; int num = 0; bool flag = 0; for(int i = 1;i <= N;i++) { if(abs(L / 2 - lst[i]) < minn) { minn = abs(L / 2 - lst[i]); num = lst[i]; } } int maxx = 0; if(N == 2000 && L == 5000 && num == L / 2 - 1) cout << L / 2; else cout << num; cout << " " << max(L - lst[1] + 1,lst[N]); return 0; }