#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);

ll gcd(ll a, ll b) {
  ll v0=a, v1=b, v2=v0%v1;
  while(v2>0) {
    v0 = v1;
    v1 = v2;
    v2 = v0%v1;
  }
  return v1;
}

int main() {
  int N, M;
  cin>>N>>M;
  ll A[N], B[M];
  for(int i=0;i<N;++i) cin>>A[i];
  for(int i=0;i<M;++i) cin>>B[i];
  ll ans = 0;
  ll a, b;
  ll tmp, t, num, tmpsum;
  for(int i=0;i<N;++i) {
    for(int j=0;j<M;++j) {
      a = A[i];
      b = B[j];
      ans += b*(b+1)/2%mod*(a/b%mod)%mod;
      ans %= mod;
      a %= b;
      if(a==0) continue;
      tmp = gcd(a, b);
      t = b/tmp;
      tmp = t*a/b%mod;
      num = (t-1)/tmp;
      tmpsum = (tmp-1)*tmp/2%mod*num%mod;
      tmpsum += tmp;
      tmpsum %= mod;
      ans += b/t*tmpsum%mod;
      ans %= mod;
      cout<<tmp<<endl;
      ans += (b/t-1)*(b/t)/2%mod*tmp%mod*t%mod;
      ans %= mod;
    }
  }
  cout<<2*ans%mod<<endl;
}