#include using namespace std; typedef long long ll; const int INF = (1<<30)-1; const ll LINF = (1LL<<60)-1; #define rep(i, n) for (int i = 0; i < n; i++) #define sz(a) (int)(a.size()) template bool chmax(T &a, T b) {if (a < b) {a = b;return true;}else return false;} template bool chmin(T &a, T b) {if (a > b) {a = b;return true;}else return false;} #define MAX (ll)1e6+1 //nCrのnの最大値+1 ll fac[MAX], inv[MAX], finv[MAX]; void COMinit(ll mod) { fac[0] = 1, finv[0] = 1; fac[1] = 1, inv[1] = 1, finv[1] = 1; for (int i = 2; i < MAX; i++) { fac[i] = fac[i-1] * i % mod; inv[i] = mod - (inv[mod % i] * (mod/i) % mod) % mod; finv[i] = finv[i-1] * inv[i] % mod; } } ll COM(ll n, ll k, ll mod) { if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * finv[k] % mod * finv[n-k] % mod; } //コーナーケースに気をつけろ! int main() { ll n, k, p; cin >> n >> k >> p; vector a(n), b(n); rep(i, n) { cin >> a[i]; a[i] %= p; } rep(i, n) { cin >> b[i]; b[i] %= p; } sort(b.begin(), b.end()); ll l = -1, r = p-1; while (l + 1 < r) { ll x = (l + r) / 2, cnt = 0; //cout << "x = " << x << endl; rep(i, n) { //cout << a[i] << " "; cnt += upper_bound(b.begin(), b.end(), x-a[i]) - b.begin(); //cout << a[i] - x << " 以下 " << upper_bound(b.begin(), b.end(), x-a[i]) - b.begin() << " "; if (max(0LL, max(p-a[i], x-a[i]+1)) <= x + p - a[i]) { cnt += upper_bound(b.begin(), b.end(), x+p-a[i]) - lower_bound(b.begin(), b.end(), max(0LL, max(p-a[i], x-a[i]+1))); //cout << max(a[i]-p, x-a[i]+1) << "以上" << x+p-a[i] << "以下 " << upper_bound(b.begin(), b.end(), x+p-a[i]) - lower_bound(b.begin(), b.end(), max(a[i]-p, x-a[i]+1)); } //cout << endl; } //cout << cnt << endl; if (cnt >= k) r = x; else l = x; } cout << r << endl; return 0; } //小数点精度 //cout << fixed << std::setprecision(15) << y << endl;