#include<stdio.h>
#include<algorithm>
using namespace std;
int a[20010],b[20010];
int main(){
int i,m,n,s,x;
while(scanf("%d%d",&n,&m)&&n&&m){
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=m;i++)
scanf("%d",&b[i]);
sort(a+1,a+n+1);
sort(b+1,b+m+1);
s=0;x=1;
for(i=1;i<=m;i++){
if(a[x]<=b[i]){
s+=b[i];
if(++x>n)break;
}
}
if(x<=n)puts("Loowater is doomed!");
else printf("%d\n",s);
}
return 0;
}
#include<algorithm>
using namespace std;
int a[20010],b[20010];
int main(){
int i,m,n,s,x;
while(scanf("%d%d",&n,&m)&&n&&m){
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=m;i++)
scanf("%d",&b[i]);
sort(a+1,a+n+1);
sort(b+1,b+m+1);
s=0;x=1;
for(i=1;i<=m;i++){
if(a[x]<=b[i]){
s+=b[i];
if(++x>n)break;
}
}
if(x<=n)puts("Loowater is doomed!");
else printf("%d\n",s);
}
return 0;
}