#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void Judge(bool b) { b ? Yes() : No(); }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void JUDGE(bool b) { b ? YES() : NO(); }
ll powMod(ll b, ll e, ll m) {
  ll r = 1;
  while (e > 0) {
    if (e & 1) r = (r % m) * (b % m) % m;
    b = (b % m) * (b % m) % m;
    e >>= 1;
  }
  return r;
}
double distance(ll x1, ll y1, ll x2, ll y2) {
  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <typename T>
void ppp(T n) {
  cout << n << endl;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  vector<ll> x(n), y(m);
  for (int i = 0; i < (n); ++i) {
    cin >> x[i];
  }
  for (int i = 0; i < (m); ++i) {
    cin >> y[i];
  }
  ll X = 0LL, Y = 0LL;
  for (int i = 0; i < n; ++i) {
    X += (i * x[i] - (n - i - 1) * x[i]) % 1000000007;
  }
  for (int i = 0; i < m; ++i) {
    Y += (i * y[i] - (m - i - 1) * y[i]) % 1000000007;
  }
  ppp(X * Y % 1000000007);
  return 0;
}
