R=range
J=lambda:list(map(int,input().split()))
N,M,L=J()
A=J()
B=J()
I=1<<33
C=[[I]*(L+1)for i in R(L+1)]
def G(i,j):return C[i][j]if 0<=i<=L and 0<=j<=L else I
C[0][0]=0
for(v,b)in sorted([(v,0)for v in A]+[(v,1)for v in B]):
	D=[c[:]for c in C]
	if b:
		for i in R(L+1):
			for j in R(L+1):D[i][j]=G(i,j-1)-v if i<j else(G(i,j-1)+v if i>j else min(G(i,j),G(i,j-1)+v))
	else:
		for i in R(L+1):
			for j in R(L+1):D[i][j]=G(i-1,j)+v if i<j else(G(i-1,j)-v if i>j else min(G(i,j),G(i-1,j)+v))
	C=D
print(G(L,L))