#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000010, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
int n, m, w[N];


int a[N], b[N];
int main() {
    cin >> n >> m;
    for (int i = 1; i < n + 1; i++) scanf("%d", a + i);
    for (int i = 1; i < m + 1; i++) scanf("%d", b + i);
    sort(a + 1, a + n + 1);
    sort(b + 1, b + m + 1);
    ll res = 0, l = 1;
    for (int i = 1; i < m + 1; i++) {
        while (l <= n && a[l] < b[i]) l++;
        a[l] == b[i] ? res -= a[l++] : 0;
        res += b[i];
    }
    for (int i = 1; i < n + 1; i++) res += a[i];
    printf("%lld\n", res % MOD);
    res = 0, l = 1;
    ll sum = 0;
    for (int i = 1; i < m + 1; i++) {
        while (l != n + 1 && a[l] <= b[i]) sum += a[l++];
        res = (res + sum + (n - l + 1) * b[i]) % MOD;
    }
    printf("%lld\n", res);
    return 0;
}