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

const int MN = 1e5 +5;

long long n,m,a[MN],b[MN];

long long br=0;

vector<long long> v;
vector<long long>::iterator it;

int main()
{
	
	freopen("planets.in", "r", stdin);
	freopen("planets.out", "w", stdout);
	
	cin>>n>>m;
	
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	
	sort(a+1,a+n+1);
	
	for(int i=1;i<=m;i++){
		cin>>b[i];
	}
	
	sort(b+1,b+m+1);
	
	int j=1;
	for(int i=1;i<=m;i++){
		
		while(j<=n){
		
			if(a[j]>b[i]){
				break;
			}
		
			v.push_back(a[j]);
			
			j++;
			
		}
		
		if(m-i+1<v.size()){
			
			br+=(b[i]-v[m-i])*(b[i]-v[m-i]);
			
			it = find(v.begin(), v.end(),v[m-i]);
			v.erase(it);
			
		}
		else{
			br+=(b[i]-v[v.size()-1])*(b[i]-v[v.size()-1]);
			
			it = find(v.begin(), v.end(),v[v.size()-1]);
			v.erase(it);
		}
		//cout<<br<<"\n";
	}
	
	
	cout<<br<<"\n";
	
	
	
	
	
	
	return 0;
}
/*

8 6 
1 3 4 7 8 9 13 17
4 5 9 12 16 19


*/