#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint1000000007;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  VI a(n), b(m);
  rep(i, n) cin >> a[i];
  rep(j, m) cin >> b[j];
  map<int, array<int, 2>> d;
  rep(i, n) d[a[i]][0]++;
  rep(j, m) d[b[j]][1]++;
  mint mn, mx;
  for (auto x : a) mn += x;
  for (auto x : b) mn += x;
  int now = 0;
  int cnt[2]{n, m};
  for (const auto& [nxt, di] : d) {
    mx += mint(nxt - now) * cnt[0] * cnt[1];
    mn -= mint(min(di[0], di[1])) * nxt;
    cnt[0] -= di[0];
    cnt[1] -= di[1];
    now = nxt;
  }
  cout << mn.val() << '\n';
  cout << mx.val() << '\n';
}