/*#pragma GCC optimize("O3")
#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")*/
#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/
#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000007
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(time(0));
ll randll(ll l, ll r) {
return uniform_int_distribution<ll>(l, r)(rng);
}
int main(){
speed;
srand(time(0));
ll n, k;
cin >> n >> k;
vll a(n);
vpll b;
for (int i = 0; i < n; i ++) {
cin >> a[i];
bool q = 0;
if (a[i] >= k) q = 1;
b.pb({a[i]%k, q});
}
sort(b);
ll maxl = -INF, mn = INF;
ll minl = b.back().fr-b[0].fr;
for (int i = 0; i < n; i ++) {
multiset<ll> s;
for (int j = 0; j <= i; j ++) {
s.insert(b[j].fr+k);
}
for (int j = i+1; j < n; j ++) {
s.insert(b[j].fr);
}
minl = min(minl, *--s.end()-*s.begin());
for (int j = n-1; j > i; j --) {
if (b[j].fr-k <= b[i].fr) break;
s.erase(s.find(b[j].fr));
s.insert(b[j].fr-k);
minl = min(minl, *--s.end()-*s.begin());
}
}
cout << minl/2+minl%2 << endl;
}
