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

long long n,k1,k2,a[1005];
priority_queue<long long>pq;

int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	
	cin >> n >> k1 >> k2;
	k1 += k2;
	for(int i = 1; i <= n; i++)
		cin >> a[i];
	for(int i = 1; i <= n; i++){
		int tmp;
		cin >> tmp;
		pq.push(abs(a[i] - tmp));
	}
	
	while(pq.size() && k1 > 0){
		int tmp = pq.top();
		pq.pop();
		
		k1--;
		tmp--;
		if(tmp)
			pq.push(tmp);
	}
	if(k1 > 0)
		cout << (k1 & 1);
	else{
		long long sum = 0;
		while(pq.size())
			sum += pow(pq.top(),2), pq.pop();
		cout << sum;
	}
	
	return 0;
}