#include<bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

template <typename T> bool chkmax(T &x,T y){return x<y?x=y,true:false;}
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,true:false;}

int readint(){
	int x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

int n,k,sr,sb,sa;
int a[65],r[65],b[65],d[65][3005],f[65][3005];

int main(){
	n=readint(); k=readint();
	for(int i=1;i<=n;i++) a[i]=readint();
	for(int i=1;i<=k;i++) r[i]=readint();
	for(int i=1;i<=k;i++) b[i]=readint();
	for(int i=1;i<=k;i++) sr+=r[i],sb+=b[i];
	for(int i=1;i<=n;i++) sa+=a[i];
	sort(r+1,r+k+1); reverse(r+1,r+k+1);
	sort(b+1,b+k+1); reverse(b+1,b+k+1);
	sort(a+1,a+n+1); reverse(a+1,a+n+1);
	memset(f,0x3f,sizeof(f));
	memset(d,0x3f,sizeof(d));
	d[0][0]=0;
	for(int i=1;i<=n;i++){
		for(int j=0;j<=i;j++){
			for(int l=0;l<=sr;l++){
				if(j&&j<=k&&l>=a[i]) chkmin(f[j][l],d[j-1][l-a[i]]+max(0,a[i]-r[j]));
				if(i-j&&i-j<=k) chkmin(f[j][l],d[j][l]+max(0,a[i]-b[i-j]));
			}
		}
		swap(d,f);
		memset(f,0x3f,sizeof(f));
	}
	int ans=0x3f3f3f3f;
	for(int i=0;i<=k;i++) for(int k=0;k<=sr;k++) if(sa-k<=sb) chkmin(ans,d[i][k]);
	printf("%d\n",ans==(0x3f3f3f3f)?-1:ans);
	return 0;
}
