uva 11292

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>

using namespace std;

#define MAXNM (20000+5)

int dra[MAXNM], per[MAXNM];

int main(){
int n, m;

while(scanf("%d%d", &n, &m) && (n+m)){
for(int i = 1; i <= n; i++) scanf("%d", &dra[i]);
for(int i = 1; i <= m; i++) scanf("%d", &per[i]);

if(n > m){
printf("Loowater is doomed!\n");
continue;
}

sort(dra+1, dra+n+1);
sort(per+1, per+m+1);

int db = 1, pb = 1, ans = 0;
while(pb <= m && db <= n){
if(dra[db] <= per[pb]){
ans += per[pb];
db++; pb++;
continue;
}

pb++;
}

if(db > n) printf("%d\n", ans);
else printf("Loowater is doomed!\n");
}

return 0;
}