# The Dragon of Loowater

Time Limit: 1000MS

Memory Limit: 65536K

## Input

The input contains several test cases. The first line of each test case contains two integers between 1 and 20000 inclusive, indicating the number n of heads that the dragon has, and the number m of knights in the kingdom. The next n lines each contain an integer, and give the diameters of the dragon's heads, in centimetres. The following m lines each contain an integer, and specify the heights of the knights of Loowater, also in centimetres. The last test case is followed by a line containing: 0 0

## Output

For each test case, output a line containing the minimum number of gold coins that the king needs to pay to slay the dragon. If it is not possible for the knights of Loowater to slay the dragon, output the line: Loowater is doomed!

## Sample Input

2 3
5
4
7
8
4
2 1
5
5
10
0 0


## Sample Output

11
Loowater is doomed!


## Source

Waterloo Local Contest, 2007.9.29