#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<long long, long long>;
long long dx[] = {1, 0, -1, 0};
long long dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
ll fact(long long i) {
  if (i == 0) return 1;
  return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
long long keta(ll n) {
  if (n == 0) return 1;
  long long count = 0;
  while (n != 0) {
    n /= 10;
    count++;
  }
  return count;
}
ll ketasum(ll n) {
  ll sum = 0;
  while (n != 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
bool isprime(long long n) {
  if (n == 1) return false;
  if (n == 2) return true;
  for (long long i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) return false;
  }
  return true;
}
signed main() {
  long long n, m;
  cin >> n >> m;
  vector<long long> rui(n + 1), RUI(m + 1);
  rui[0] = RUI[0] = 0;
  for (long long i = 0; i < (long long)(n); i++) {
    long long a;
    cin >> a;
    rui[i + 1] = a + rui[i];
    rui[i + 1] %= mod;
  }
  for (long long i = 0; i < (long long)(m); i++) {
    long long a;
    cin >> a;
    RUI[i + 1] = a + RUI[i];
    RUI[i + 1] %= mod;
  }
  long long s = 0, t = 0;
  for (long long i = 1; i <= (long long)(n - 1); i++) {
    s += (rui[n] - rui[i]) - (rui[i] - rui[i - 1]) * (n - i);
    s %= mod;
  }
  for (long long i = 1; i <= (long long)(m - 1); i++) {
    t += (RUI[m] - RUI[i]) - (RUI[i] - RUI[i - 1]) * (m - i);
    t %= mod;
  }
  cout << s * t % mod << endl;
  return 0;
}
