#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--) // [a, b)
#define reprev(i,n) reprrev(i,0,n)
typedef long long ll;
typedef unsigned long long ull;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

/* attention
    long longのシフト演算には気をつけよう
    タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
    sizeは(int)とキャストしよう
    cin.tie(0);
    ios::sync_with_stdio(false);<- これら、printfとかと併用しない方が良さそう

*/

const ll mod = 1e9+7;

void chmod(ll &M){
    if(M >= mod) M %= mod;
    else if(M < 0){
        M += (abs(M)/mod + 1)*mod;
        M %= mod;
    }
}

ll modpow(ll x, ll n){
    if(n==0) return 1;
    ll res=modpow(x, n/2);

    if(n%2==0) return res*res%mod;
    else return res*res%mod*x%mod;
}

int getl(int i, int N) { return i==0? N-1:i-1; };
int getr(int i, int N) { return i==N-1? 0:i+1; };


// 線分 ab の偏角 返り値は[-π, π]
double argument(const pair<double, double> &a, const pair<double, double> &b){
    double ax=a.first, ay=a.second, bx=b.first, by=b.second;
    return atan2(by-ay, bx-ax);
}

/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */


template <std::uint_fast64_t Modulus>
class modint {
    using u64 = std::uint_fast64_t;

public:
    u64 a;

    constexpr modint(const u64 x = 0) noexcept : a(x%Modulus) {}
    constexpr u64 &value() noexcept { return a; }
    constexpr const u64 &value() const noexcept { return a; }
    constexpr modint operator +(const modint rhs) const noexcept { return modint(*this) += rhs; }
    constexpr modint operator -(const modint rhs) const noexcept { return modint(*this) -= rhs; }
    constexpr modint operator *(const modint rhs) const noexcept { return modint(*this) *= rhs; }
    constexpr modint operator /(const modint rhs) const noexcept { return modint(*this) /= rhs; }
    constexpr modint & operator +=(const modint rhs) noexcept {
        a += rhs.a;
        if(a >= Modulus) a -= Modulus;
        return *this;
    }
    constexpr modint & operator -=(const modint rhs) noexcept {
        if(a < rhs.a) a += Modulus;
        a -= rhs.a;
        return *this;
    }
    constexpr modint & operator *=(const modint rhs) noexcept {
        a = a * rhs.a % Modulus;
        return *this;
    }
    constexpr modint & operator /=(modint rhs) noexcept {
        u64 exp = Modulus - 2;
        while(exp){
            if(exp % 2) { *this *= rhs; }
            rhs *= rhs;
            exp /= 2;
        }
        return *this;
    }
};


int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    using mint = modint<mod>;
    int n, m; cin >> n >> m;
    vector<ll> x(n), y(m);
    rep(i, n) cin >> x[i];
    rep(i, m) cin >> y[i];

    mint X = 0, Y = 0;
    rep(i, n)  X += (2*i+1-n) * x[i]; 
    rep(i, m)  Y += (2*i+1-m) * y[i];

    cout << (X*Y) << endl;



    return 0;
}
