#include <bits/stdc++.h>
using namespace std;
long long Set(long long N, long long pos) { return N = N | (1 << pos); }
long long reset(long long N, long long pos) { return N = N & ~(1 << pos); }
bool check(long long N, long long pos) { return (bool)(N & (1 << pos)); }
void CI(long long &_x) { scanf("%d", &_x); }
void CO(long long &_x) { cout << _x; }
template <typename T>
void getarray(T a[], long long n) {
  for (long long i = 0; i < n; i++) cin >> a[i];
}
template <typename T>
void prLLIarray(T a[], long long n) {
  for (long long i = 0; i < n - 1; i++) cout << a[i] << " ";
  cout << a[n - 1] << endl;
}
const double EPS = 1e-9;
const long long INF = 0x7f7f7f7f;
long long dr8[8] = {1, -1, 0, 0, 1, -1, -1, 1};
long long dc8[8] = {0, 0, -1, 1, 1, 1, -1, -1};
long long dr4[4] = {0, 0, 1, -1};
long long dc4[4] = {-1, 1, 0, 0};
long long kn8r[8] = {1, 2, 2, 1, -1, -2, -2, -1};
long long kn8c[8] = {2, 1, -1, -2, -2, -1, 1, 2};
vector<int> price;
map<string, int> MP;
struct node {
  string s;
  int n;
};
bool comp(node a, node b) { return a.n > b.n; }
int main() {
  int n, m;
  cin >> n >> m;
  for (long long i = 0; i < n; i++) {
    int temp;
    cin >> temp;
    price.push_back(temp);
  }
  sort(price.begin(), price.end());
  vector<int> VV;
  VV = price;
  for (int i = 0; i < m; i++) {
    string str;
    cin >> str;
    MP[str]++;
  }
  vector<node> V;
  map<string, int>::iterator it;
  for (it = MP.begin(); it != MP.end(); it++) {
    node temp;
    string first;
    int second;
    first = (it->first);
    second = it->second;
    temp.s = first;
    temp.n = second;
    V.push_back(temp);
  }
  sort(V.begin(), V.end(), comp);
  int maxi = 0;
  for (int i = 0; i < V.size(); i++) {
    maxi += (V[i].n * VV.back());
    VV.pop_back();
  }
  reverse(price.begin(), price.end());
  int mini = 0;
  for (int i = 0; i < V.size(); i++) {
    mini += (V[i].n * price.back());
    price.pop_back();
  }
  cout << mini << " " << maxi << "\n";
  return 0;
}
