#include <bits/stdc++.h>
using namespace std;
const long long oo = 2147383647;
const double pi = 2 * acos(0.0);
const double eps = 1e-9;
inline long long gcd(long long a, long long b) {
  a = ((a) < 0 ? -(a) : (a));
  b = ((b) < 0 ? -(b) : (b));
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
long long ext_gcd(long long A, long long B, long long *X, long long *Y) {
  long long x2, y2, x1, y1, x, y, r2, r1, q, r;
  x2 = 1;
  y2 = 0;
  x1 = 0;
  y1 = 1;
  for (r2 = A, r1 = B; r1 != 0;
       r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
    q = r2 / r1;
    r = r2 % r1;
    x = x2 - (q * x1);
    y = y2 - (q * y1);
  }
  *X = x2;
  *Y = y2;
  return r2;
}
inline long long modInv(long long a, long long m) {
  long long x, y;
  ext_gcd(a, m, &x, &y);
  x %= m;
  if (x < 0) x += m;
  return x;
}
inline long long power(long long a, long long p) {
  long long res = 1, x = a;
  while (p) {
    if (p & 1) res = (res * x);
    x = (x * x);
    p >>= 1;
  }
  return res;
}
inline long long bigmod(long long a, long long p, long long m) {
  long long res = 1 % m, x = a % m;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
const int N = 100001;
int x[N], y[N];
long long dpX[N], dpY[N];
const long long mod = 1e9 + 7;
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", x + i);
  for (int i = 1; i <= m; i++) scanf("%d", y + i);
  for (int i = 1; i <= n; i++) {
    dpX[i] = (i - 1) * x[i];
    dpX[i] -= (n - i) * x[i];
    while (dpX[i] < 0) dpX[i] += mod;
    dpX[i] += mod;
    dpX[i] = ((i - 1) * x[i] - (n - i) * x[i] + mod + mod) % mod;
    dpX[i] %= mod;
  }
  for (int i = 1; i <= m; i++) {
    dpY[i] = (i - 1) * y[i];
    dpY[i] -= (m - i) * y[i];
    while (dpY[i] < 0) dpY[i] += mod;
    dpY[i] %= mod;
  }
  for (int i = 2; i <= n; i++) dpX[i] += dpX[i - 1], dpX[i] %= mod;
  for (int i = 2; i <= m; i++) dpY[i] += dpY[i - 1], dpY[i] %= mod;
  printf("%lld\n", (dpX[n] * dpY[m]) % mod);
  return 0;
}
