#include<bits/stdc++.h>
using namespace std;
const long long N=20000+10;
long long top[N],mo[N],n,m,sum=0;
int main()
{
	cin>>n>>m;
	if (n > m){
		cout << "you died!";
		return 0;
	}
	for (long long i=1;i<=n;i++){
		cin >> top[i];
	}
	for (long long i = 1;i <= m;i++){
		cin >> mo[i];
	}
	sort (top + 1,top + n + 1);
	sort (mo + 1,mo + m + 1);
	long long i,j;
	for (i = 1,j = 1;i <= n and j <= m;){
		if (top[i] <= mo[j]){
			sum += mo[j];
			i++;j++;
		}
		else{
			j++;
		}
	}
	if (j >= m and i < n){
		cout << "you died!";
		return 0;
	}
	cout<<sum;
	return 0;
}