#include <iostream>
#include <algorithm>

using namespace std;

const int N = 20000+10;

int n,m,sum,l;
int a[N],b[N];

int main(){
	cin >> n >> m;
	for(int i=1;i<=n;i++) cin >> a[i],l+=a[i];
	for(int i=1;i<=m;i++) cin >> b[i];
	sort(b+1,b+m+1);
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){  
		int pos=lower_bound(b+1,b+m+1,a[i])-b;
		sum+=b[pos];
		b[pos]=-1;
	}
	if(n>m || sum<l) cout << "you died!" << endl;
	else cout << sum << endl;
	return 0;
}