#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
struct nd{
    LL x,y;int id;
    bool operator<(const nd& a) const{
        return (x-y)*(x-y)<(a.x-a.y)*(a.x-a.y);
    }
};
priority_queue<nd> apple;
LL arr[1005],brr[1005];
int k1,k2,n;
int main(){
    scanf("%d%d%d",&n,&k1,&k2);
    for (int i=1;i<=n;++i){scanf("%lld",arr+i);}
    for (int i=1;i<=n;++i){scanf("%lld",brr+i);}
    for (int i=1;i<=n;++i){apple.push({arr[i],brr[i],i});}
    nd cur;
    ++k1;while (--k1){
        cur=apple.top();apple.pop();
        if (cur.x>cur.y){--arr[cur.id];}else{++arr[cur.id];}
        apple.push({arr[cur.id],brr[cur.id],cur.id});
    }
    ++k2;while (--k2){
        cur=apple.top();apple.pop();
        if (cur.x>cur.y){++brr[cur.id];}else{--brr[cur.id];}
        apple.push({arr[cur.id],brr[cur.id],cur.id});
    }
    LL ans=0;
    for (int i=1;i<=n;++i){ans+=(arr[i]-brr[i])*(arr[i]-brr[i]);}
    printf("%lld",ans);
    return 0;
}