#include<iostream>
#include<algorithm>
using namespace std;

int n,m;
int a[20005],b[20005];

int main()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
    {
        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 cur = 0,cost = 0;
    for(int i = 1;i <= m;i++)
        if(b[i] >= a[cur])
        {
            cost += b[i];
            if(++cur == n) break;
        }
    if(cur < n) cout << "you died!" << endl;
    else cout << cost;
    return 0;
}