#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;
vector<int> b;

int consistency(int n, int k1, int k2){

    priority_queue<int> pq;
    for(int i=0; i<n; i++){
        pq.push(abs(a[i]-b[i]));
    }

    int k = k1+k2;
    for(int i=1; i<=k; i++){
        auto diff = pq.top(); pq.pop();
        pq.push(abs(diff-1));
    }

    int ans = 0;
    while(!pq.empty()){
        auto top = pq.top(); pq.pop();
        ans += (top*top);
    }

    return ans;

}















int practice(int n, int k1, int k2){


    return 0;
}





void solve() {
    
    int n, k1, k2;
    cin>> n >> k1 >> k2;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    b.resize(n);
    for(int i=0; i<n; i++) cin >> b[i];
    
    cout << consistency(n, k1, k2) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}