#include<iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
long long n,m,a[20005],b[20005];long long sum;
int cmd(int a,int b){
	return a>b;
}
int main()
{
	cin>>n>>m;
	if(n>m){
		cout<<"you died!";
		return 0;
	}
	for(int i=1;i<=n;i++)
	cin>>a[i];
	for(int i=1;i<=m;i++)
	cin>>b[i];
	sort(a+1,a+1+n,cmd);
	sort(b+1,b+1+n,cmd);
	if(a[1]>b[1])
	{
		cout<<"you died!";
		return 0;
	}
	for(int i=1;i<=n;i++){
		bool s=0;
		for(int l=m;l>=1;l--)
			{
				
				if(a[i]<=b[l])
				{
					sum+=b[l];
					b[l]=0;
					s=1;
					break;
					
				}
				
			}
			if(s==0){
					cout<<"you died!";
					return 0;
				}
	}
		
	cout<<sum;
}