#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int n,m;
int a[1000010];
int check(int x)
{
  int ss=0;
  for(int i=1;i<=n;i++)
  {
    if(a[i]-x==m)
       ss+=a[i]-x;
    else
    {
		ss=a[i];
    }
  }
  if(ss==m) return true;
  else       return false;
}
int main()
{
  freopen("eko.in","r",stdin);
  freopen("eko.out","w",stdout);
  cin>>n>>m;
  int maxx=-1000;
  for(int i=1;i<=n;i++)
  {
	  cin>>a[i];
	  if(a[i]>maxx)  maxx=a[i];
  }
  sort(a+1,a+n+1);
  int Left,Right;
  Left=maxx;
  Right=m;
  while(Left+1<Right)
  {
    int mid=(Left+Right)/2;
	if(check(mid))  Right=mid;
	else            Left=mid;
  }
  if(check(Left))  cout<<Left<<endl;
  else             cout<<Right<<endl;
  fclose(stdin);fclose(stdout);
  return 0;
}