#include<iostream>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<unordered_map>
#include<stack>
#include<queue>
#include<math.h>
#include<functional>
#include<bitset>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define MOD 1000000007LL
#define INF 1000000000LL
#define EPS 1e-10
#define FOR(i,n,m) for(ll i=n;i<(int)m;i++)
#define REP(i,n) FOR(i,0,n)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cout<<" ";else cout<<endl;}
#define ALL(v) v.begin(),v.end()
#define UNIQUE(v)  sort(ALL(v));v.erase(unique(ALL(v)),v.end());
#define pb push_back

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll n, l;
	cin >> n >> l;
	set<ll> xx, yy;
	REP(i, n) {
		ll tmp;
		cin >> tmp;
		xx.insert(tmp);
	}
	REP(i, n) {
		ll tmp;
		cin >> tmp;
		yy.insert(tmp);
	}
	ll lb = 0, ub = INF * INF;
	while(ub - lb > 1) {
		ll m = (ub + lb) / 2;
		ll pos = m % l, tmp = 0;
		set<ll> x = xx, y = yy;
		REP(i, n) {
			auto ite = y.upper_bound(pos);
			if(ite == y.begin()) {
				tmp += pos + 1;
				pos = l - 1;
				ite = y.end();
				ite--;
			} else ite--;
			tmp += pos - *ite;
			pos = *ite;
			y.erase(ite);
			ite = x.upper_bound(pos);
			if(ite == x.begin()) {
				tmp += l - pos;
				pos = 0;
				ite = x.end();
				ite--;
			} else ite--;
			tmp += pos - *ite;
			pos = *ite;
			x.erase(ite);
		}
		tmp += pos;
		if(tmp > m) lb = m;
		else ub = m;
	}
	cout << ub << endl;
	return 0;
}

/* --------------------------------------- */