#include <iostream>
#include <vector>
#include <queue>
#include <bits/stdc++.h>
using namespace std;
const int maxn = 255;

char mat[maxn][maxn];
int main() {
    int n, m;
    cin >> n >> m;

    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> mat[i][j];
        }
    }

    vector<vector<bool>> visited(n, vector<bool>(m, false));

    int di[] = {-1, 1, 0, 0};
    int dj[] = {0, 0, -1, 1};


    int vkupno_ovci = 0, vkupno_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);
                q.push(j);

                visited[i][j] = true;

                int ovci = 0, volci = 0;

                while(!q.empty()) {
                    int ci = q.front();
                    q.pop();
                    int cj = q.front();
                    q.pop();

                    if(mat[ci][cj] == 'o') {
                        ovci++;
                    }
                    if(mat[ci][cj] == 'v') {
                        volci++;
                    }

                    for(int k = 0; k < 4; k++) {
                        int ti = ci + di[k];
                        int tj = cj + dj[k];

                        if(ti >= 0 and ti < n and tj >= 0 and tj < m and !visited[ti][tj] and mat[ti][tj] != '#') {
                            q.push(ti);
                            q.push(tj);
                            visited[ti][tj] = true;
                        }
                    }

                }

                if(ovci > volci) {
                    vkupno_ovci += ovci;
                }
                else {
                    vkupno_volci += volci;
                }



            }
        }
    }

    cout << vkupno_ovci << " " << vkupno_volci << endl;




    return 0;
}

/*
5 7
####..#
S...#.#
.......
#.#.#.E
#######

 **/