#include<bits/stdc++.h>
#define MAXN 1000001
using namespace std;
unsigned long long n,m,a[MAXN],q[MAXN];
bool g[MAXN];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    freopen("planets.in","r",stdin);
    freopen("planets.out","w",stdout);
    cin>>n>>m;
    for(long long i=0;i<n;i++){
        cin>>a[i];
    }
    for(long long i=0;i<m;i++){
        cin>>q[i];
    }
    sort(a,a+n);
    sort(q,q+m);
    long long ans=0;
    long long ind=m-1,qind=0;
    for(long long i=0;i<n;i++){
        if(qind>=m) break;
        long long ii=i;
        while(i==n-1 || (q[qind]>=a[i] && q[qind]<a[i+1])){
             // cout<<qind<<" "<<i<<" vlizam\n";
            long long inAns;
            if(ind>i) inAns=ii;
            else inAns=ind;
            ans+=(q[qind]-a[inAns])*(q[qind]-a[inAns]);
            g[inAns]=true;
            qind++;
            if(qind>=m) break;
            while(g[ind]){
                    ind--;
                    if(ind<0) break;
            }
            while(g[ii]){
                    ii--;
                    if(ii<0) break;
            }
        }
    }
    cout<<ans<<"\n";
    return 0;
}