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

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

const int MOD = 1e9 + 7;

int main() {
  int H, W;
  cin >> H >> W;
  vl A(H), B(W);
  fore(i, A) cin >> i;
  fore(i, B) cin >> i;
  sort(all(A));
  sort(all(B));
  ll ansl = 0, ansg = 0;
  {
    int a = 0, b = 0;
    while (a < H || b < W) {
      if (a < H && b < W) {
        if (A[a] == B[b]) {
          ansl += A[a];
          a++, b++;
        } else if (A[a] < B[b]) {
          ansl += A[a++];
        } else {
          ansl += B[b++];
        }
      } else if (a < H) {
        ansl += A[a++];
      } else {
        ansl += B[b++];
      }
      ansl %= MOD;
    }
  }
  {
    ll cntH = 0, cntW = 0;
    vector<pll> C;
    C.reserve(H + W);
    fore(i, A) C.push_back(pll{i, 0});
    fore(i, B) C.push_back(pll{i, 1});
    sort(all(C));
    reverse(all(C));
    for (auto [v, c] : C) {
      if (c == 0) {
        ansg += v * cntW;
        cntH++;
      } else {
        ansg += v * cntH;
        cntW++;
      }
      ansg %= MOD;
    }
  }
  cout << ansl << '\n' << ansg << '\n';
}