#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <int mod>
struct ModInt {
  int x;
  ModInt() : x(0) {}
  ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  ModInt &operator+=(const ModInt &p) {
    if ((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p) {
    if ((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
  ModInt &operator^=(long long p) {
    ModInt res = 1;
    for (; p; p >>= 1) {
      if (p & 1) res *= *this;
      *this *= *this;
    }
    return *this = res;
  }
  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
  ModInt operator^(long long p) const { return ModInt(*this) ^= p; }
  bool operator==(const ModInt &p) const { return x == p.x; }
  bool operator!=(const ModInt &p) const { return x != p.x; }
  explicit operator int() const { return x; }
  ModInt operator=(const int p) {
    x = p;
    return ModInt(*this);
  }
  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      a -= t * b;
      std::swap(a, b);
      u -= t * v;
      std::swap(u, v);
    }
    return ModInt(u);
  }
  friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &p) {
    return os << p.x;
  }
  friend std::istream &operator>>(std::istream &is, ModInt<mod> &a) {
    long long x;
    is >> x;
    a = ModInt<mod>(x);
    return (is);
  }
};
struct MComb {
  std::vector<ModInt<1000000007> > fact;
  std::vector<ModInt<1000000007> > inversed;
  MComb(int n) {
    fact = std::vector<ModInt<1000000007> >(n + 1, 1);
    for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * ModInt<1000000007>(i);
    inversed = std::vector<ModInt<1000000007> >(n + 1);
    inversed[n] = fact[n] ^ (1000000007 - 2);
    for (int i = n - 1; i >= 0; i--)
      inversed[i] = inversed[i + 1] * ModInt<1000000007>(i + 1);
  }
  ModInt<1000000007> ncr(int n, int r) {
    return (fact[n] * inversed[r] * inversed[n - r]);
  }
  ModInt<1000000007> npr(int n, int r) { return (fact[n] * inversed[n - r]); }
  ModInt<1000000007> nhr(int n, int r) {
    assert(n + r - 1 < (int)fact.size());
    return ncr(n + r - 1, r);
  }
};
ModInt<1000000007> ncr(int n, int r) {
  ModInt<1000000007> res = 1;
  for (int i = n - r + 1; i <= n; i++) res *= i;
  for (int i = 1; i <= r; i++) res /= i;
  return res;
}
const ll mod = 1e9 + 7;
int main() {
  int n, m;
  cin >> n >> m;
  vector<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];
  ModInt<1000000007> dx(*max_element(a.begin(), a.end()) -
                        *min_element(a.begin(), a.end()));
  ModInt<1000000007> dy(*max_element(b.begin(), b.end()) -
                        *min_element(b.begin(), b.end()));
  ModInt<1000000007> numx =
      (ModInt<1000000007>(2) ^ (n - 2)) * (ModInt<1000000007>(2) ^ (m - 2));
  cout << (dx * dy) * numx << endl;
}
