#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
template<typename T,typename U> T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U> T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S> bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S> bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii; 
typedef vector<int> vi;
typedef vector<pii> vp;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=1e5+5,inf=1e18;
int n,w,a[N],b[N],m,res,ans1,ans2;

signed main() {
  n=read(), w=read();
  rep(i,1,n) a[i]=read();
  sort(a+1,a+n+1); a[0]=w;
  int k=0; while(k<n&&a[k+1]<w) k++;
  reverse(a+1,a+k+1);
  rep(i,1,n) ans1+=min(abs(a[i]-a[i-1]),abs(a[i]-w));
  sort(a+1,a+n+1);
  int m=(n%2?n/2+1:n/2);
  rep(i,1,m) b[i*2-1]=a[i];
  reverse(a+m+1,a+n+1);
  rep(i,m+1,n) b[(i-m)*2]=a[i];
  b[0]=w;
  res=0; rep(i,1,n) res+=max(abs(b[i]-b[i-1]),abs(b[i]-w)); chmax(ans2,res);
  sort(a+1,a+n+1); reverse(a+1,a+n+1);
  rep(i,1,m) b[i*2-1]=a[i];
  reverse(a+m+1,a+n+1);
  rep(i,m+1,n) b[(i-m)*2]=a[i];
  b[0]=w;
  res=0; rep(i,1,n) res+=max(abs(b[i]-b[i-1]),abs(b[i]-w)); chmax(ans2,res);
  printf("%lld %lld\n",ans1,ans2);
  return 0;
}