#include <bits/stdc++.h>
// pbds
/*#include <ext/pb_ds/assoc_container.hpp> // Common file*/
/*#include <ext/pb_ds/tree_policy.hpp>*/
/**/
/*using namespace __gnu_pbds;*/
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x...) 42
#endif
#define fast_io                                                                \
  ios_base::sync_with_stdio(false);                                            \
  cin.tie(NULL);                                                               \
  cout.tie(NULL);
#define ll long long
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

/*typedef tree<int, null_type, less<int>, rb_tree_tag,*/
/*             tree_order_statistics_node_update>*/
/*    ordered_set;*/

bool vis[105][105];
bool cnt[105][105];
vector<string> v;
map<char, vector<pair<int, int>>> mp;
map<pair<int, int>, vector<char>> mpp;
map<char, ll> peop;
void dfs(int i, int j, int n, int m, char a) {
  if (i < 0 || j < 0 || i >= n || j >= m || vis[i][j] || v[i][j] == 'X')
    return;
  vis[i][j] = 1;
  if (v[i][j] == '.' || v[i][j] == a || v[i][j] == ' ') {
    ll key = i * 1000 + j;
    if (v[i][j] == '.') {
			peop[a]++;
			cnt[i][j] = 1;
      mpp[{i, j}].push_back(a);
    }
    if (mp.find(key) != mp.end()) {
      mp[a].push_back({i, j});
    } else {
      mp[a] = {{i, j}};
    }
    dfs(i - 1, j, n, m, a);
    dfs(i + 1, j, n, m, a);
    dfs(i, j - 1, n, m, a);
    dfs(i, j + 1, n, m, a);
  }
}

void solve() {
  ll n, m;
  cin >> n >> m;
  string a;
  v.resize(n);
  getline(cin, a);
  ll dot = 0;
  for (int i = 0; i < n; i++) {
    getline(cin, v[i]);
  }
  set<int> un;
  memset(cnt, 0, sizeof cnt);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      dot += (v[i][j] == '.');
      if (v[i][j] == 'X' || v[i][j] == '.' || v[i][j] == ' ')
        continue;
      memset(vis, 0, sizeof vis);
      dfs(i, j, n, m, v[i][j]);
    }
  }
  vector<pair<int, char>> vp;
  for (auto c : peop) {
    vp.push_back({c.second, c.first});
  }
  sort(rall(vp));
  vector<vector<bool>> check(n, vector<bool>(m, 0));
  ll score = 0;
  set<char> curr;
  for (auto x : mpp) {
    if (x.second.size() == 1 && curr.find(*x.second.begin()) == curr.end()) {
      if (!check[x.first.first][x.first.second]) {
        curr.insert(*x.second.begin());
        check[x.first.first][x.first.second] = 1;
      }
      continue;
    }
    char fuck = 'Z';
    char fc = 0;
    bool idd = 1;
    for (auto y : x.second) {
      if (curr.find(y) != curr.end()) {
        idd = 1;
        check[x.first.first][x.first.second] = 1;
        break;
      }
      if (peop[y] > fc) {
        fc = peop[y];
        fuck = y;
      }
    }
    if (idd && fuck != 'Z') {
      check[x.first.first][x.first.second] = 1;
      curr.insert(fuck);
    }
  }
  cout << curr.size() << " ";
  int nvis = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      nvis += cnt[i][j];
    }
  }
  cout << (dot - nvis) << "\n";
}

int main() {
  fast_io;
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  freopen("output.txt", "w", stderr);
#endif
  ll t = 1;
  /*cin >> t;*/
  while (t--) {
#ifdef LOCAL
    cout << "TEST CASE " << t + 1 << "\n";
#endif
    solve();
  }
#ifdef LOCAL
  cout << endl
       << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n\n";
#endif
  return 0;
}