UVa 11292

#include<bits/stdc++.h>
using namespace std;

typedef unsigned long long int  ull;
typedef long long int      ll;
typedef vector<int>        vi;
typedef vector<ll>         vll;
typedef vector<vi>         vvi;
typedef pair<int,int >     pii;
typedef vector< pii >      vpii;
typedef set<int>           sti;

#define sc                 scanf
#define pf                 printf
#define sci(n)             scanf("%d",&n)
#define scl(n)             scanf("%lld",&n)
#define scd(n)             scanf("%lf",&n)
#define scs(s)             scanf("%s",s)
#define pfi(n)             printf("%d",n)
#define pfl(n)             printf("%lld",n)
#define pff(n)             cout<<n
#define line               printf("\n")
#define spc                printf(" ")
#define loop(i,x,y)        for(int i=int(x); i<=int(y); i++)
#define rloop(i,y,x)       for(int i=int(y); i>=int(x); i--)
#define cspf(i)            printf("Case %d: ", i)
#define pb                 push_back
#define mp                 make_pair
#define ff                 first
#define ss                 second
#define all(v)             v.begin(),v.end()
#define rall(v)            v.rbegin(),v.rend()
#define read()             freopen("input.txt", "r", stdin)
#define write()            freopen("output.txt", "w", stdout)
/// Constants
#define eps                1e-9
#define PI                 acos(-1.0)  // 3.1415926535897932
#define MAX                1000009

int main()
{
    int d,k;
    while(cin>>d>>k && d!=0 && k!=0){
        vi hd(d),nt(k);
        loop(i,0,d-1){
            cin>>hd[i];
        }
        loop(i,0,k-1){
            cin>>nt[i];
        }
        sort(all(hd));
        sort(all(nt));
        bool flg=1;
        int sum=0;
        for(int i=0,j=0;i<d;i++,j++){
            if(d-i>k-j){
                flg=0;
                break;
            }
            if(hd[i]>nt[j]){
                i--;
                continue;
            }
            sum+=nt[j];
        }
        if(flg){
            cout<<sum<<endl;
        }
        else{
            cout<<"Loowater is doomed!"<<endl;
        }
    }
    return 0;
}