import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################


"""
 1 2 3
00
11
11
2.2
3..3

 11114
11111.
2....2
2....2
4....4

"""

mod = 10 ** 9 + 7

from collections import defaultdict
def solve1(h, w, a, b):
    d = defaultdict(int)
    for i in range(h):
        d[a[i]] += 1 << 32
    
    for j in range(w):
        d[b[j]] += 1
    
    ans = 0
    for i in d:
        x, y = divmod(d[i], 1 << 32)
        # print(i, x, y)
        ans += i * max(x, y)
    return ans % mod

def solve2(h, w, a, b):
    i = 0
    j = 0
    ans = 0
    while i < h and j < w:
        if a[i] < b[j]:
            ans += (w - j) * a[i]
            i += 1
        else:
            ans += (h - i) * b[j]
            j += 1
    return ans % mod

h, w = na()
a = sorted(na())
b = sorted(na())

# print(a)
# print(b)
print(solve1(h, w, a, b))
print(solve2(h, w, a, b))