poj 3646

#include<iostream>
#include<algorithm>
#define c_max 20002
using namespace std;
int ch[c_max], ch1[c_max];

int main()
{
	int n, m;
	while(scanf("%d%d", &n, &m) != EOF && (n&&m))
	{
		int i;
		for( i=0; i < n; i++ )
			scanf("%d", ch+i);
		for( i=0; i < m; i++ )
			scanf("%d", ch1+i);
		sort(ch, ch+n);
		sort(ch1, ch1+m);
		int sum = 0, t = 0;
		for( i=0; i < m; i++ )
		{
			if(ch1[i] >=  ch[t])
				sum += ch1[i], t++;
			if(t == n)
				break;
		}
		if(i == m)
			printf("Loowater is doomed!\n");
		else
			printf("%d\n", sum);
	}

	return 0;
}