#include <iostream>
#include <vector>
using namespace std;
int max_time=0;
int min_time=0;
void solve(const vector<int> &ivec, const int L);
int main()
{
int n=0,L;
vector<int> ivec;
std::cin>>n>>L;
for (int i = 0; i !=n; ++i)
{
int dis_left=0;
cin>>dis_left;
ivec.push_back(dis_left);
}
solve(ivec, L);
cout<<"maxTime: "<<max_time<<"minTime"<<min_time;
return 0;
}
void solve(const vector<int> &ivec, const int L)
{
for (decltype(ivec.size()) i = 0; i !=ivec.size() ; ++i)
{
min_time=max(min_time,min(L-ivec.at(i),ivec.at(i)));
max_time=max(max_time,max(ivec.at(i),L-ivec.at(i)));
}
}