#include<bits/stdc++.h>

#define MAXN 100001
#define int long long

using namespace std;

int n, m, start[MAXN], days[MAXN], ind[MAXN], planetInd = -1;
bool used[MAXN];

void read()
{
    freopen("planets.in", "r", stdin);
    freopen("planets.out", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>m;
    for(int i = 0; i < n; i ++)
    {
        cin>>start[i];
    }
    for(int i = 0; i < m; i ++)
    {
        cin>>days[i];
    }
    sort(start, start + n);
}
void solve()
{
    for(int i = 0; i < m; i ++)
    {
        int curDay = days[i];
        while(planetInd + 1 < n && start[planetInd + 1] <= curDay)
        {
            planetInd ++;
        }
        ind[i] = planetInd;
    }
    /*for(int i = 0; i < m; i ++)
    {
        cout<<ind[i]<<endl;
    }
    cout<<endl;*/
    for(int i = 0; i < m - 1; i ++)
    {
        int br = 0, begI = i;
        while(i < m && ind[i] == ind[i + 1])
        {
            br ++;
            i ++;
        }
        for(int j = i; j > begI; j --)
        {
            ind[j] -= br;
            br --;
        }
    }
    /*for(int i = 0; i < m; i ++)
    {
        cout<<ind[i]<<endl;
    }
    cout<<endl; */
    for(int i = 0; i < m; i ++)
    {
        used[ind[i]] = 1;
    }
    int lastDone = 0;
    for(int i = m; i > -1; i --)
    {
        while(lastDone < ind[i])
        {
            if(!used[lastDone])
            {
                used[lastDone] = 1;
                ind[i] = lastDone;
                lastDone ++;
                break;
            }
            else lastDone ++;
        }
    }
    int ans = 0;
    for(int i = 0; i < m; i ++)
    {
        //cout<<ind[i]<<endl;
        ans += (days[i] - start[ind[i]]) * (days[i] - start[ind[i]]);
    }
    cout<<ans<<endl;
}
signed main()
{
    read();
    solve();
    return 0;
}
/*
7 5
0 0 4 5 6 9 10
1 2 6 7 10
*/