#include<bits/stdc++.h>
using namespace std;
int n,m,ans[5];
int a[100005];
int b[100005];
int k[100005];
int main()
{
	cin>>n>>m;
	if(m<n)
	{
		cout<<"you died!";
		return 0;
	}
	for(int i=1;i<=n;i++)
	{
		k[i]=-1;
		cin>>a[i];
	}
	for(int i=1;i<=m;i++)
	{
		cin>>b[i];
	}
	sort(a+1,a+n+1);
	sort(b+1,b+m+1);
	int j=0,qwe=0;
    for (int i=1;i<=n;i++)
	{
 	  	while (a[i]>b[j]&&j<=m) 
		j++;
 	  	qwe+=b[j];
 	   	if (j>m) break;
		j++; 
	}
    if(j<n)
    {
    	cout<<"you died!";
	}
	else
	{
		cout<<qwe;
	}
	return 0;
}