#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define MP(a, b) make_pair(a, b)
const int MAXN = 20000 + 10;
const int INF = 0x3f3f3f3f;
 
int dag[MAXN], knt[MAXN];
 
int main()
{
    //freopen("input.txt", "r", stdin);
    int n, m, i, j;
    while (scanf("%d%d", &n, &m), n + m)
    {
        for (i = 0; i < n; i++)
            scanf("%d", &dag[i]);
        for (i = 0; i < m; i++)
            scanf("%d", &knt[i]);
        sort(dag, dag + n);
        sort(knt, knt + m);
        int ans = 0;
        i = 0;
        for (j = 0; j < m; j++)
            if (knt[j] >= dag[i])
            {
                ans += knt[j];
                i++;
                if (i == n)
                    break;
            }
        i != n ? printf("Loowater is doomed!\n") : printf("%d\n", ans);
    }
    return 0;
}