#pragma GCC optimize("Ofast")
#include<cstdio>
#include<algorithm>
using namespace std;
unsigned long floor_sum(unsigned int N,unsigned int M,unsigned int A,unsigned int B)
//Sum[floor((A*i+B)/M),{i,0,N-1}]
{
	unsigned long ans=0;
	if(B>=M)
	{
		unsigned int BM=B/M;
		ans+=(unsigned long)N*BM;
		B-=BM*M;
	}
	while(true)
	{
		unsigned int AM=A/M;
		ans+=(unsigned long)N*(N-1)/2*AM;
		A-=AM*M;
		if((unsigned long)A*N+B<M)break;
		unsigned long Ym=((unsigned long)A*N+B)/M,Xm=Ym*M-B;
		unsigned long TX=(Xm+A-1)/A;
		ans+=(N-TX)*Ym;
		N=Ym;
		B=TX*A-Xm;
		swap(A,M);
	}
	return ans;
}
int N,M;
int A[2000],B[2000];
main()
{
	scanf("%d%d",&N,&M);
	for(int i=0;i<N;i++)scanf("%d",&A[i]);
	for(int i=0;i<M;i++)scanf("%d",&B[i]);
	unsigned long ans=0;
	for(int i=0;i<N;i++)
	{
		for(int j=0;j<M;j++)
		{
			ans+=2*floor_sum(B[j],B[j],A[i],A[i]);
			ans%=(int)1e9+7;
		}
	}
	printf("%ld\n",ans);
}