#include<bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &x)
{
	x=0;short f=1;char c=getchar();
	for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
	for(;c>='0'&&c<='9';c=getchar()) x=(x<<1)+(x<<3)+(c^48);
	x*=f;return;
}
const int N=1e5+5,mod=1e9+7;
#define ll long long
int n,m;
int a[N],b[N];
set<ll>S;
void work(ll x)
{
	for(ll i=2;i*i<=x;++i)
	{
		if(x%i) continue;
		while(x%i==0) x/=i;
		S.insert(i);
	}
	if(x>1) S.insert(x);
}
int main()
{
	read(n),read(m);
	int gcda=0,gcdb=0;
	for(int i=1;i<=n;++i)
		read(a[i]),gcda=__gcd(gcda,a[i]);
	for(int i=1;i<=m;++i)
		read(b[i]),gcdb=__gcd(gcdb,b[i]);
	work(gcda),work(gcdb);
	ll lcm=1ll*gcda*gcdb/__gcd(gcda,gcdb);
	int ans=1;
	for(ll p:S)
	{
		int cnt=1;
		ll tmp=p,x=lcm;
		while(x%p==0)
		{
			++cnt;
			x/=p;
			tmp*=p;
		}
		int ansa=1,ansb=1;
		for(int i=1;i<=n;++i)
			if(a[i]%tmp)
				ansa=1ll*ansa*cnt%mod;
		for(int i=1;i<=m;++i)
			if(b[i]%tmp)
				ansb=1ll*ansb*cnt%mod;
		ans=1ll*ans*(ansa+ansb-1)%mod;
	}
	printf("%d\n",ans);
}