#include <iostream>
#include <vector>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
using namespace std;
#define FastIO cin.tie(nullptr) -> sync_with_stdio(false);
#define Cases int __; cin >> __; for (int _ = 1; _ <= __; _ ++)
#define endl '\n'
#define aa first
#define bb second
const string yes = "Yes";
const string no = "No";

typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int N = 2e3 + 2;
const int inf = 0x3f3f3f3f;
int n, m;
char s[N][N];

// string solve() {
// void solve() {
int solve() {
    cin >> n >> m;
    for (int i = 0; i < n; i ++) cin >> s[i];
    vector<vector<int>> e(n);
    int cnt = 0;
    for (int i = 0; i < n; i ++) {
        for (int j = 0; j < m; j ++)
            if (s[i][j] == 'C') e[i].emplace_back(j), cnt ++;
    }
    int res = 0;
    while (cnt) {
        int x = 0, y = 0;
        res ++;
        while (x < n && y < m) {
            // cout << x << ' ' << y << ' ' << cnt << endl;
            while (!e[x].size() && x < n) x ++;
            if (x == n) break;
            for (int i = 0; i < e[x].size(); i ++) {
                if (e[x][i] >= y) {
                    int dx = e[x].size() - i;
                    cnt -= dx;
                    y = e[x].back();
                    while (dx --) e[x].erase(-- e[x].end());
                    break;
                }
            }
            x ++;
        }
    }
    return res;
}

int main() {
    FastIO
    // Cases
    cout << solve() << endl;
    // solve();
    return 0;
}