/**
	author:  shobonvip
	created: 2025.12.21 00:54:01
**/

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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint1000000007 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int h, w;
	cin >> h >> w;

	vector<ll> a(h), b(w);
	rep(i,0,h) cin >> a[i];
	rep(i,0,w) cin >> b[i];

	map<ll,pair<ll,ll>> mp;
	rep(i,0,h) mp[a[i]].first++;
	rep(i,0,w) mp[b[i]].second++;

	vector<pair<ll,int>> p;
	rep(i,0,h) p.emplace_back(a[i],0);
	rep(i,0,w) p.emplace_back(b[i],1);
	sort(all(p));
	reverse(all(p));

	ll a_num = 0, b_num = 0;
	mint ans_min = 0;
	mint ans_max = 0;
	for (auto [x,dat]: mp) {
		ans_min += mint(max(dat.first,dat.second))*x;
	}

	for (auto [x,t]: p) {
		if (t == 0) {
			a_num++;
			ans_max += mint(b_num) * x;
		} else {
			b_num++;
			ans_max += mint(a_num) * x;
		}
	}



	cout << ans_min.val() << '\n';
	cout << ans_max.val() << '\n';
}