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

using ll = int64_t;
using mint = modint1000000007;
constexpr ll mod = 1000000007;

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

void input() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> H >> W;
    A.resize(H);
    for (ll i=0; i<H; ++i) cin >> A[i];
    B.resize(W);
    for (ll j=0; j<W; ++j) cin >> B[j];
}

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_tle() {
    int ans = 0;
    for (int i=0; i<H; ++i) {
        for (int j=0; j<W; ++j) {
            ans += min(A[i], B[j]);
        }
        ans %= mod;
    }
    cout << ans << "\n";
}

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