#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;

using ll = int64_t;
using mint = modint1000000007;

int H, W;
vector<ll> A, B;

void input() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> H >> W;
    assert(H >= 1 && H <= 100000);
    assert(W >= 1 && W <= 100000);
    A.resize(H);
    for (ll i=0; i<H; ++i) {
        cin >> A[i];
        assert(A[i] >= 0 && A[i] <= 1000000000);
    }
    B.resize(W);
    for (ll j=0; j<W; ++j) {
        cin >> B[j];
        assert(B[j] >= 0 && B[j] <= 1000000000);
    }
    // 積み重ね方が存在する条件は max(A)=max(B)
    assert(*max_element(A.begin(), A.end()) == *max_element(B.begin(), B.end()));
}

void solve_min() {
    unordered_map<ll, ll> a, b;
    unordered_set<ll> unique;
    for (ll i=0; i<H; ++i) {
        ++a[A[i]];
        unique.insert(A[i]);
    }
    for (ll j=0; j<W; ++j) {
        ++b[B[j]];
        unique.insert(B[j]);
    }
    mint ans = 0;
    for (ll h : unique) {
        ans += h * max(a[h], b[h]);
    }
    cout << ans.val() << "\n";
}

void solve_max() {
    // 降順ソート
    sort(A.rbegin(), A.rend());
    sort(B.rbegin(), B.rend());
    // 番兵を挿入
    A.push_back(-1);
    B.push_back(-1);
    // 尺取り法
    vector<ll> a(H), b(W);
    ll ia = 0, ib = 0;
    while (ia < H || ib < W) {
        if (A[ia] <= B[ib]) {
            b[ib] = ia;
            ++ib;
        } else {
            a[ia] = ib;
            ++ia;
        }
    }
    mint ans = 0;
    for (ll i=0; i<H; ++i) {
        ans += a[i] * A[i];
    }
    for (ll j=0; j<W; ++j) {
        ans += b[j] * B[j];
    }
    cout << ans.val() << "\n";
}

int main() {
    input();
    solve_min();
    solve_max();
    return 0;
}