#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define sc second

void solve() {
    int n, m; cin >> n >> m;
    vector<string> s(n);
    for (int i = 0; i < n; i++) cin >> s[i];
    vector<vector<int>> g(2 * n * m);
    vector<int> poss(2 * n * m, 0), used(2 * n * m, 0);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (s[i][j] == 'G') {
                if (i > 0 && i < n - 1 && j > 0 && j < m - 1 && s[i - 1][j] == 'R' && s[i + 1][j] == 'W' && s[i][j - 1] == 'R' && s[i][j + 1] == 'W') {
                    int nm1 = ((i - 1) * m + j) * 2, nm2 = (i * m + j - 1) * 2 + 1;
                    g[nm1].pb(nm2);
                    g[nm2].pb(nm1);
                }
            } else if (s[i][j] == 'R') {
                if (i < n - 2 && s[i + 1][j] == 'G' && s[i + 2][j] == 'W') poss[(i * m + j) * 2] = 1;
                if (j < m - 2 && s[i][j + 1] == 'G' && s[i][j + 2] == 'W') poss[(i * m + j) * 2 + 1] = 1;
                if (i < n - 2 && j < m - 2 && s[i + 1][j] == 'G' && s[i + 2][j] == 'W' && s[i][j + 1] == 'G' && s[i][j + 2] == 'W') {
                    int nm1 = (i * m + j) * 2, nm2 = (i * m + j) * 2 + 1;
                    g[nm1].pb(nm2);
                    g[nm2].pb(nm1);
                }
            } else {
                if (i > 1 && j > 1 && s[i - 1][j] == 'G' && s[i - 2][j] == 'R' && s[i][j - 1] == 'G' && s[i][j - 2] == 'R') {
                    int nm1 = ((i - 2) * m + j) * 2, nm2 = (i * m + j - 2) * 2 + 1;
                    g[nm1].pb(nm2);
                    g[nm2].pb(nm1);
                }
            }
        }
    }
    int c0 = 0, c1 = 0;
    vector<int> col(2 * n * m, 0);
    auto dfs = [&](int v, auto&&dfs) -> void {
        used[v] = 1;
        if (col[v]) c1++;
        else c0++;
        for (auto &u : g[v]) {
            if (!used[u]) {
                col[u] = 1 - col[v];
                dfs(u, dfs);
            }
        }
    };
    int ans = 0;
    for (int i = 0; i < 2 * n * m; i++) {
        if (!used[i] && poss[i]) {
            c0 = 0; c1 = 0;
            dfs(i, dfs);
            ans += max(c0, c1);
        }
    }
    cout << ans << '\n';
}

signed main() {
    int tt = 1;
    #ifdef LOCAL 
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #else
        ios::sync_with_stdio(false); 
        cin.tie(0); cout.tie(0);
    #endif

    while (tt--) {
        solve();
    }

    return 0;
}