#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 10000000000000000;
int n,m,k;int a[1000005],b[1000005],c[1000005],v1[500005],v2[500005];
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> m >> k;
	for(int i =1;i<=n;i++)cin >> a[i];
	for(int i = 1;i<=m;i++)cin >> b[i];
	sort(a+1,a+1+n),sort(b+1,b+1+m);
	int need1 = 0,need2 = 0;
	for(int i = 1;i<=n;i++)need1+=(a[i]-a[1])/k;
	for(int i = 1;i<=m;i++)need2+=(b[i]-b[1])/k;
	for(int i = 1;i<=n;i++)a[i]-=(a[i]-a[1])/k*k;
	for(int i = 1;i<=m;i++)b[i]-=(b[i]-b[1])/k*k;
	sort(a+1,a+1+n),sort(b+1,b+1+m);
	if(need1>need2){
	//	cout << 111 << endl;
		swap(need1,need2),swap(a,b);swap(n,m);
	}
	need2-=need1;need2%=n;memcpy(c,a,sizeof(c));
	for(int i= 1;i<=need2;i++)a[i] = c[n-need2+i];
	for(int i =need2+1;i<=n;i++)a[i] = c[i-need2]+k;
	for(int i = 1;i<=n;i++)a[i+n] = a[i]+k;for(int i = 1;i<=m;i++)b[i+m] = b[i]+k;
	for(int i = 1;i<=n;i++)v1[i] = a[i+n-1]-a[i];
	for(int i = 1;i<=m;i++)v2[i] = b[i+m-1]-b[i];
//	for(int i= 1;i<=n;i++)cout << a[i] << " ";cout << endl;
//	for(int i = 1;i<=m;i++)cout << b[i] << " ";cout << endl;
	int g = __gcd(n,m);int ans = inf;
	for(int i = 1;i<=g;i++){
		int mn1 = inf,mn2 = inf;
		for(int j = i;j<=n;j+=g)mn1 = min(mn1,v1[j]);
		for(int j = i;j<=m;j+=g)mn2 = min(mn2,v2[j]);
		ans = min(ans,mn1+mn2);
	}cout << ans << endl;
	return 0;
}
/*
这我哪会啊?
显然两边极差都可以变成<k，然后做循环移位，然后可以划分出若干等价类
感觉就这样？
不懂。
*/