#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<char> patt = {'R', 'G', 'W'};
    auto check = [&](int i, int j, pair<int, int> d) {
        for (int k = 0; k < 3; k++) {
            if (i >= n || j >= m) return false;
            if (s[i][j] != patt[k]) return false;
            i += d.first; j += d.second;
        }
        return true;
    };
    int ans = 0;
    for (int s = 0; s <= n + m - 2; s++) {
        vector<pair<int, int>> can;
        for (int i = 0; i < n; i++) {
            if (s - i >= 0 && s - i < m) {
                can.pb({check(i, s - i, {0, 1}), check(i, s - i, {1, 0})});
            }
        }
        vector<vector<int>> dp(sz(can) + 1, vector<int>(4, 0));
        for (int i = 0; i < sz(can); i++) {
            // dp[i + 1]
            for (int j = 0; j < 4; j++) {
                dp[i + 1][(j >> 1)] = max(dp[i + 1][(j >> 1)], dp[i][j]);
            }
            if (can[i].first) {
                dp[i + 1][0] = max(dp[i + 1][0], dp[i][0] + 1);
            }
            if (can[i].second) {
                for (int j = 0; j < 4; j++) {
                    dp[i + 1][(j >> 1) + 2] = max(dp[i + 1][(j >> 1) + 2], dp[i][j] + 1);
                }
            }
        }
        ans += max(max(max(dp.back()[0], dp.back()[1]), dp.back()[2]), dp.back()[3]);
        //cout << s << ' ' << max(max(max(dp.back()[0], dp.back()[1]), dp.back()[2]), dp.back()[3]) << '\n';
    }
    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;
}