Minimize the error （贪心）

You are given two arrays A and B, each of size n. The error, E, between these two arrays is defined . You have to perform exactly k₁ operations on array A and exactly k₂ operations on array B. In one operation, you have to choose one element of the array and increase or decrease it by 1.

Output the minimum possible value of error after k₁ operations on array A and k₂ operations on array B have been performed.

Input

The first line contains three space-separated integers n (1 ≤ n ≤ 10³), k₁ and k₂ (0 ≤ k₁ + k₂ ≤ 10³, k₁ and k₂ are non-negative) — size of arrays and number of operations to perform on A and B respectively.

Second line contains n space separated integers a₁, a₂, ..., a_n ( - 10⁶ ≤ a_i ≤ 10⁶) — array A.

Third line contains n space separated integers b₁, b₂, ..., b_n ( - 10⁶ ≤ b_i ≤ 10⁶)— array B.

Output

Output a single integer — the minimum possible value of after doing exactly k₁ operations on array A and exactly k₂ operations on array B.

Examples

Input

2 0 0
1 2
2 3

Output

2

Input

2 1 0
1 2
2 2

Output

0

Input

2 5 7
3 4
14 4

Output

1

Note

In the first sample case, we cannot perform any operations on A or B. Therefore the minimum possible error E = (1 - 2)² + (2 - 3)² = 2.

In the second sample case, we are required to perform exactly one operation on A. In order to minimize error, we increment the first element of A by 1. Now, A = [2, 2]. The error is now E = (2 - 2)² + (2 - 2)² = 0. This is the minimum possible error obtainable.

In the third sample case, we can increase the first element of A to 8, using the all of the 5 moves available to us. Also, the first element of B can be reduced to 8 using the 6 of the 7 available moves. Now A = [8, 4] and B = [8, 4]. The error is now E = (8 - 8)² + (4 - 4)² = 0, but we are still left with 1 move for array B. Increasing the second element of B to 5 using the left move, we get B = [8, 5] and E = (8 - 8)² + (4 - 5)² = 1.

题意：两个长度为n的数组A，B，对A可以操作k1次，对B可以操作k2次，每次操作可以将任意的元素+或- 1，求操作后对应元素差的平方和

思路：每次将对应元素差的绝对值最大的减一，如果为0，将任意一个加一，最后直接求和即可

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<cmath>
using namespace std;
const int N = 1005;
struct node{
	int a,b;
	int val;
}arr[N];
int cmp(node x,node y){
	return x.val>y.val;
}
int main(){
	int n,k1,k2;
	scanf("%d%d%d",&n,&k1,&k2);
	for(int i=0;i<n;i++)
	   scanf("%d",&arr[i].a);
	for(int i=0;i<n;i++){
		scanf("%d",&arr[i].b);
		arr[i].val=abs(arr[i].a-arr[i].b);
	}
	sort(arr,arr+n,cmp);
	int op=k1+k2;
	for(int i=0;i<op;i++){
		if(arr[0].val==0) arr[0].val++;
		else arr[0].val--;
		sort(arr,arr+n,cmp);
	}
	long long int ans=0;
	for(int i=0;i<n;i++)
	   ans+=pow(arr[i].val,2);
	cout<<ans<<endl;
	return 0;
}