#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define int long long
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef tree<pii,null_type,less<pii>,rb_tree_tag,
tree_order_statistics_node_update> oset;
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mid (l+r)/2
#define all(x) x.begin(),x.end()
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define sp <<" "<<
#define DEBUG(x) cout<<(#x) sp x<<endl
#define carp(a,b) (((a%MOD)*(b%MOD))%MOD)
#define topla(a,b) (((a%MOD)+(b%MOD))%MOD)
const int INF=1e18;
const int MAXN=2e5+5;
const int MOD=998244353;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,t;
cin>>n>>t;
deque<pii> a(n);
vi b(n);
FOR(i,n){
cin>>a[i].fi;
b[i]=a[i].fi;
a[i].fi%=t;
a[i].se=i;
}
sort(all(a));
int ans=INF;
FOR(i,n){
//contp(a);
int fark=a.back().fi-a.front().fi+1;
//DEBUG(fark);
ans=min(ans,fark/2);
auto el=a.front();
if(el.fi+t>b[el.se]) break;
a.pb({el.fi+t,el.se});
a.pop_front();
}
cout<<ans<<endl;
}
