#include<bits/stdc++.h>
using namespace std;
int n,m,a[100010],b[100010];
long long num;
int f;
void check(int temp){
int l=1,r=m,mid;
while(l<=r){
mid=l+(r-l)/2;
if(a[mid]>temp) r=mid-1;
else l=mid+1;
f=abs(temp-a[mid]);
}
f=min(f,abs(temp-a[mid+1]));
f=min(f,abs(temp-a[mid-1]));
return ;
}
int main(){
scanf("%d %d",&m,&n);
for(int i=1;i<=m;i++) scanf("%d",&a[i]);
for(int i=1;i<=n;i++) scanf("%d",&b[i]);
sort(a+1,a+m+1);
for(int i=1;i<=n;i++){
f=2000000;
check(b[i]);
num+=f;
}
printf("%d",num);
return 0;
}