#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
const long long MOD = 1000000000 + 7;
const int mod = 1000000007;
struct mint {
  long long x;
  mint(long long x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(long long t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
int main() {
  int n, m;
  cin >> n >> m;
  set<long long> x;
  set<long long> y;
  for (int i = 0; i < n; i++) {
    long long tmp;
    cin >> tmp;
    x.insert(tmp);
  }
  for (int i = 0; i < (int)(m); i++) {
    long long tmp;
    cin >> tmp;
    y.insert(tmp);
  }
  mint delx = 0;
  mint cnt = 1;
  for (auto itr = x.begin(); itr != x.end(); itr++) {
    delx += cnt * mint(*itr);
    delx -= (mint(n) - cnt) * mint(*itr);
    cnt += 1;
  }
  mint dely = 0;
  cnt = 1;
  for (auto itr = y.begin(); itr != y.end(); itr++) {
    dely += cnt * mint(*itr);
    dely -= (mint(m) - cnt) * mint(*itr);
    cnt += 1;
  }
  mint ans = delx * dely;
  cout << ans << endl;
  return 0;
}
