#include<bits/stdc++.h>
using namespace std;

int main(){
    int m,n;
    cin>>m>>n;
    int i=0,j=0,a[m],b[n];
    for (i = 0; i < m; i++)
    {
        cin>>a[i];
    }
    for (j = 0; j < n; j++)
    {
        cin>>b[j];
    }
    sort(a,a+m);
    int k,sum=0;
    for (i = 0; i < n; i++)
    {
        k=lower_bound(a,a+m,b[i])-a;
        if (a[k]!=b[i])
        {
            if (b[i]<a[0])
            {
                sum+=a[k]-b[i];
            }
            else
            {
                sum+=min(abs(b[i]-a[k-1]),abs(a[k]-b[i]));
            }
        }
    }
    cout<<sum;
    return 0;
}