ll@h,@w,a[h+1]{},b[w+1]{};
rd(a(h),b(w));
sortA(h+1,a);
sortA(w+1,b);
if(1){
	Mint z;
	ll c=h,d=w;
	while(a[c]|b[d]){
		ll x=max(a[c],b[d]);
		ll e=0,f=0;
		while(a[c]==x){
			--c;
			++e;
		}
		while(b[d]==x){
			--d;
			++f;
		}
		z+=x*max(e,f);
	}
	wt(z);
}
if(1){
	Mint z;
	ll y=sum(a(h+1));
	ll c=h,d=w;
	while(b[d]){
		while(a[c]>b[d]){
			y-=a[c--];
		}
		z+=y+b[d]*(h-c);
		--d;
	}
	wt(z);
}