#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<functional>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int> > mati;
typedef vector<vector<double> > matd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cout << VEC[i] << " ";
  }
  cout << "\n";
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i, MAT.size()){
    REP(j, MAT[i].size()){
      cout << MAT[i][j] << " ";
    }
    cout << "\n";
  }
};

template <typename CLASS1, typename CLASS2>
class HOGE{
  public:
    CLASS1 key;
    CLASS2 value;
    HOGE(void){
      return;
    };
    HOGE(CLASS1 key, CLASS2 value){
      this->key = key;
      this->value = value;
    };
    ~HOGE(void){
      return;
    };

    void print(void){
      cout << "key : " << key << ", value : " << value << "\n";
      return;
    };
    
    bool operator==(const HOGE &obj){
      return (this->value == obj.value);
    };
    bool operator<(const HOGE &obj){
      return (this->value < obj.value);
    };
    bool operator>(const HOGE &obj){
      return (this->value > obj.value);
    };
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

ll calc1(const vll& x, const vll& y){
  ll n = x.size();
  ll m = y.size();

  ll ans = 0;

  REP(i, n){
    FOR(j, i+1, n){
      REP(k, m){
        FOR(l, k+1, m){
          ans += (x[j]-x[i])*(y[l]-y[k])%MOD;
          ans %= MOD;
        }
      }
    }
  }
  return ans%MOD;
}

ll calc2(const vll& x, const vll& y){
  ll n = x.size();
  ll m = y.size();

  ll ans = 0;

  vll x_tmp(n-1, 0);
  vll y_tmp(m-1, 0);
  REP(i, n-1){
    x_tmp[i] = (x[i+1]-x[i])%MOD;
    x_tmp[i] *= (n-i-1);
    x_tmp[i] %= MOD;
    x_tmp[i] *= (i+1);
    x_tmp[i] %= MOD;
  }

  REP(k, m-1){
    y_tmp[k] = (y[k+1]-y[k])%MOD;
    y_tmp[k] *= (m-k-1);
    y_tmp[k] %= MOD;
    y_tmp[k] *= (k+1);
    y_tmp[k] %= MOD;
  }

  /*
  REP(i, n-1){
    REP(k, m-1){
      ll area = x_tmp[i]*y_tmp[k];
      area %= MOD;
      ans += area;
      ans %= MOD;
    }
  }
  */

  ll x_total = 0, y_total = 0;
  REP(i, n-1){
    x_total += x_tmp[i];
    x_total %= MOD;
  }
  REP(k, m-1){
    y_total += y_tmp[k];
    y_total %= MOD;
  }

  ans = (x_total*y_total)%MOD;

  return ans%MOD;
}

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll n, m;
  cin >> n >> m;
  vll x(n), y(m);
  REP(i, n) cin >> x[i];
  REP(i, m) cin >> y[i];

  /*
  ll ans1 = calc1(x, y);
  ll ans2 = calc2(x, y);

  cout << ans1 << "  " << ans2 << "\n";
  */
  cout << calc2(x, y) << "\n";

  return 0;
}

Measured memory_bytes: 3456