#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;



#define SIZE 65
#define MAX 3000

struct Info{
	Info(int arg_value){

		value = arg_value;
	}

	bool operator<(const struct Info &arg) const{
		return value > arg.value;
	}
	int value;
};

int N,K;
vector<Info> vec_A,vec_RED,vec_BLACK;
int A[SIZE],RED[SIZE],BLACK[SIZE];
int ruiseki_A[SIZE],ruiseki_RED[SIZE],ruiseki_BLACK[SIZE];
int dp[SIZE][SIZE][3005];


int main(){

	scanf("%d %d",&N,&K);

	int tmp;

	for(int i = 0; i < N; i++){

		scanf("%d",&tmp);
		vec_A.push_back(Info(tmp));
	}

	sort(vec_A.begin(),vec_A.end());

	ruiseki_A[0] = 0;
	for(int i = 1; i <= N; i++){

		A[i] = vec_A[i-1].value;
		ruiseki_A[i] = A[i];
		ruiseki_A[i] += ruiseki_A[i-1];
	}

	for(int i = 0; i < K; i++){

		scanf("%d",&tmp);
		vec_RED.push_back(Info(tmp));
	}

	sort(vec_RED.begin(),vec_RED.end());

	ruiseki_RED[0] = 0;
	for(int i = 1; i <= K; i++){

		RED[i] = vec_RED[i-1].value;
		ruiseki_RED[i] = RED[i];
		ruiseki_RED[i] += ruiseki_RED[i-1];
	}

	for(int i = 0; i < K; i++){

		scanf("%d",&tmp);
		vec_BLACK.push_back(Info(tmp));
	}

	sort(vec_BLACK.begin(),vec_BLACK.end());

	ruiseki_BLACK[0] = 0;
	for(int i = 1; i <= K; i++){

		BLACK[i] = vec_BLACK[i-1].value;
		ruiseki_BLACK[i] = BLACK[i];
		ruiseki_BLACK[i] += ruiseki_BLACK[i-1];
	}

	for(int i = 0; i <= N; i++){
		for(int k = 0; k <= K; k++){
			for(int p = 0; p <= MAX; p++){
				dp[i][k][p] = BIG_NUM;
			}
		}
	}

	dp[0][0][0] = 0;

	for(int i = 1; i <= N; i++){
		for(int r = 0; r <= K; r++){
			for(int num = 0; num <= MAX; num++){

				if(dp[i-1][r][num] == BIG_NUM)continue;

				int add;

				if(r < K){

					add = max(0,A[i]-RED[r+1]);
					dp[i][r+1][num+A[i]] = min(dp[i][r+1][num+A[i]],dp[i-1][r][num]+add);
				}

				if(i-r >= 1 && i-r <= K){

					add = max(0,A[i]-BLACK[i-r]);
					dp[i][r][num] = min(dp[i][r][num],dp[i-1][r][num]+add);
				}
			}
		}
	}

	int ans = BIG_NUM;
	int total_A = ruiseki_A[N];
	int need_red;
	int need_black;

	for(int i = 0; i <= K; i++){
		for(int num = 0; num <= MAX; num++){

			if(dp[N][i][num] == BIG_NUM)continue;

			need_red = num;

			if(ruiseki_RED[K] < need_red){

				continue;
			}

			if(num == total_A){
				ans = min(ans,dp[N][i][num]);
				continue;
			}

			if(N-i < 0 || N-i > K)continue;

			need_black = total_A-num;

			if(ruiseki_BLACK[K] < need_black){

				continue;
			}

			ans = min(ans,dp[N][i][num]);
		}
	}


	if(ans == BIG_NUM){

		printf("-1\n");

	}else{

		printf("%d\n",ans);
	}

	return 0;
}

