#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int i,m,n,k,j,cost,sum;
int dr[88888],qs[88888];
int main()
{
freopen("DragonUVa.in","r",stdin);
freopen("DragonUVa.out","w",stdout);
cin>>n>>m;
for (i=1;i<=n;++i)
cin>>dr[i];
for (i=1;i<=m;++i)
cin>>qs[i];
sort(dr+1,dr+n+1);
sort(qs+1,qs+m+1);
k=1;cost=0;sum=0;
for (i=1;i<=n;++i)
{
for (j=k;j<=m;++j)
if (qs[j]>=dr[i]&&qs[j]!=-1)
{
sum++;
k=j+1;
cost+=qs[j];
qs[j]=-1;
break;
}
}
if (sum<n) cout<<"Loowater is doomed";
else cout<<cost;
fclose(stdin);
fclose(stdout);
return 0;
}