#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;
    char mat[n][m];
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> mat[i][j];
        }
    }
    bool visited[n][m];
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            visited[i][j] = false;
        }
    }
    int preziveani_ovci = 0;
    int preziveani_volci = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if(mat[i][j] != '#' and !visited[i][j]) {
                queue<int> q;
                q.push(i); // indeks na redicata
                q.push(j); // indeks na kolonata
                visited[i][j] = true;
                int volci = 0;
                int ovci = 0;
                while(!q.empty()) {
                    int ci = q.front();
                    q.pop();
                    int cj = q.front();
                    q.pop();
                    if(mat[ci][cj] == 'v') {
                        volci += 1;
                    }
                    if(mat[ci][cj] == 'o') {
                        ovci += 1;
                    }
                    if(ci + 1 < n and mat[ci + 1][cj] != '#' and !visited[ci + 1][cj]) {
                        visited[ci + 1][cj] = true;
                        q.push(ci + 1);
                        q.push(cj);
                    }
                    if(ci - 1 >= 0 and mat[ci - 1][cj] != '#' and !visited[ci - 1][cj]) {
                        visited[ci - 1][cj] = true;
                        q.push(ci - 1);
                        q.push(cj);
                    }
                    if(cj + 1 < m and mat[ci][cj + 1] != '#' and !visited[ci][cj + 1]) {
                        visited[ci][cj + 1] = true;
                        q.push(ci);
                        q.push(cj + 1);
                    }
                    if(cj - 1 >= 0 and mat[ci][cj - 1] != '#' and !visited[ci][cj - 1]) {
                        visited[ci][cj - 1] = true;
                        q.push(ci);
                        q.push(cj - 1);
                    }
                }
                if(ovci > volci) {
                    preziveani_ovci += ovci;
                }
                else {
                    preziveani_volci += volci;
                }
            }
        }
    }
    cout << preziveani_ovci << " " << preziveani_volci << endl;
    return 0;
}
/*
 ###
 voo
 ###
 
 
 */