#include <bits/stdc++.h>
using namespace std;
int n,m;
int dragon[200001];
int knight[200001];
long long ans;
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++) scanf("%d",&dragon[i]);
	for(int i=1;i<=m;i++) scanf("%d",&knight[i]);
	sort(dragon+1,dragon+n+1);
	sort(knight+1,knight+m+1);
	int i,j;
	for(i=1,j=1;i<=n&&j<=m;) {
		if(dragon[i]<=knight[j]) {
			ans+=knight[j];
			i++,j++;
		}else j++;
	}
	if(i<n||m<n) cout<<"you died!\n";
	else cout<<ans<<endl;
    return 0;
}