#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const int N = 2e3 + 5;

int cnt;
int h, w;
char g[N][N];
int cntRow[N];
bool vis[N][N];

void solve() {
    for (int i = 0, j = 0; i < h; i++) {
        bool enter = 0;

        while (j < w && !vis[i][j])
            vis[i][j] = 1, cnt -= (g[i][j] == 'C'), cntRow[i] -= (g[i][j] == 'C'), j++, enter = 1;

        if (!cntRow[i]) {
            for (int k = 0; k < w && !vis[i][k]; k++)
                vis[i][k] = 1;
        }

        if (enter)
            j--;
    }
}

void testCase() {
    cin >> h >> w;

    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++)
            cin >> g[i][j], cnt += (g[i][j] == 'C'), cntRow[i] += (g[i][j] == 'C');
    }

    for (int i = 0; i < h; i++) {
        for (int j = w - 1; j >= 0; j--) {
            if (g[i][j] == 'C')
                break;

            vis[i][j] = 1;
        }
    }

    int sol = 0;
    while (cnt)
        solve(), sol++;

    cout << sol;
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}