UVa 11292 Dragon of Loowater

/*UVa 11292 Dragon of Loowater*/
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m;
int main(){
    while(scanf("%d%d",&n,&m) && n!=0 && m!=0){
        int i;
        int a[20050]={0};//龙头直径 
        int p[20050]={0};//骑士能力 
        for(i=1;i<=n;i++)scanf("%d",&a[i]);
        for(i=1;i<=m;i++)scanf("%d",&p[i]);
        sort(a+1,a+n+1);sort(p+1,p+m+1);
        int num=1;
        int sum=0;
        for(i=1;i<=m;i++){
            if(p[i]>=a[num])
            {
                sum+=p[i];
                num++;
            }
            if(num==n+1)break;
        }
        if(i==m+1)printf("Loowater is doomed!\n");
        else printf("%d\n",sum);
    }
    return 0;
}