UVA 11292

#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
	int N,M,x,golds,i,j,cur;
	bool flag;
	while(cin>>N>>M&&N&&M)
	{
		vector<int> heads,knights;
		golds=0;flag=false;cur=0;
		for(i=1;i<=N;i++){cin>>x;heads.push_back(x);}
		for(i=1;i<=M;i++){cin>>x;knights.push_back(x);}
		sort(heads.begin(),heads.end());
		sort(knights.begin(),knights.end());
		for(i=0;i<knights.size();i++)
		{
			if(knights[i]>=heads[cur]){golds+=knights[i];cur++;if(cur==N)break;}
		}
		if(cur<N)cout<<"Loowater is doomed!"<<endl;
		else cout<<golds<<endl;
	}
    return 0;
}