#include <cstdio>
#include <algorithm>

using namespace std;

const int maxn = 20005;

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 cur = 0;
		int cost = 0;
		for(int i = 0; i < m; ++i)
		{
			if(B[i] >= A[cur])
			{
				cost += B[i];
				if(++cur == n)
					break;
			}
		}
		if(cur < n)
			puts("Loowater is doomed!");
		else
			printf("%d\n", cost);
	}
	return 0;
}