#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=10000+5;
int a[maxn],b[maxn];
int main(){
int n,m;
while(scanf("%d%d",&n,&m)==2&&n&&m){
for(int i=0;i<n;i++)scanf("%d",&a[i]);
for(int i=0;i<m;i++)scanf("%d",&b[i]);
sort(a,a+n);
sort(b,b+m);
int cost=0;int cur=0;
for(int i=0;i<n;i++)
if(a[cur]<=b[i]){
cost+=b[i];
if(++cur==n)break;}
if(cur<n)printf("Loowater is doomed!\n");
else printf("%d\n",cost);
}
return 0;
}
08-19