#include <bits/stdc++.h>

typedef long double ld;
typedef long long ll;
using namespace std;
int di[] = {1, 0, -1, -1, 0, 1, -1, 1};
int dj[] = {1, 1, 0, -1, -1, 0, 1, -1};
const ll oo = 1e18, MOD = 998244353;
const int N = 2005, M = 350;
const ld PI = acos(-1.0), EPS = 1e-9;

int n, m, tot;
vector<int> s[N];

//#define endl '\n'
int main() {
    //ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    //freopen("farm.in", "r", stdin);
    //memset(dp, -1, sizeof dp);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            char c;
            cin >> c;
            if (c == 'C') s[i].push_back(j), tot++;
        }
    }
    int ans = 0;
    while (tot) {
        ans++;
        int x, y;
        for (int i = 1; i <= n; i++) {
            if (!s[i].empty()) {
                x = i, y = s[i].back();
                break;
            }
        }
        for (int i = x; i <= n; i++) {
            int prey = y;
            if (!s[i].empty() && s[i].back() >= y) {
                y = s[i].back();
                while (!s[i].empty() && s[i].back() >= prey) s[i].pop_back(), tot--;
            }
        }
    }
    cout << ans;
    return 0;
}