#include <bits/stdc++.h>
using namespace std;

char t[3000][3000];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #endif
    int n, m;
    cin >> n >> m;
    int ans = 0;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> t[i][j];        
        }
    }

    for (int a = 1; a <= n; a++) {
        int x = a;
        int y = 1;

        vector<int> s;
        while (1 <= x && x <= n && 1 <= y && y <= m) {
            s.emplace_back(0);
            if (t[x][y - 1] == 'R' && t[x][y] == 'G' && t[x][y + 1] == 'W') {
                s.back() |= 1;
            }
            if (t[x - 1][y] == 'R' && t[x][y] == 'G' && t[x + 1][y] == 'W') {
                s.back() |= 2;
            }
            x--, y++;
        }
        vector<vector<int>> dp(s.size(), vector<int>(3));
        
        dp[0][1] = bool(s[0] & 1);
        dp[0][2] = bool(s[0] & 2);

        for (int i = 1; i < s.size(); i++) {
            dp[i][0] = max({dp[i - 1][0], dp[i - 1][1], dp[i - 1][2]});
            if (s[i] & 1) {
                dp[i][1] = max(dp[i - 1][1], dp[i - 1][0]) + 1;
            }
            if (s[i] & 2) {
                dp[i][2] = max(dp[i - 1][2], dp[i][0]) + 1;
            }
        }

        ans += *max_element(dp.back().begin(), dp.back().end());
    }

    for (int b = 2; b <= m; b++) {
        int x = n;
        int y = b;

        vector<int> s;
        while (1 <= x && x <= n && 1 <= y && y <= m) {
            s.emplace_back(0);
            if (t[x][y - 1] == 'R' && t[x][y] == 'G' && t[x][y + 1] == 'W') {
                s.back() |= 1;
            }
            if (t[x - 1][y] == 'R' && t[x][y] == 'G' && t[x + 1][y] == 'W') {
                s.back() |= 2;
            }
            x--, y++;
        }
        vector<vector<int>> dp(s.size(), vector<int>(3));
        
        dp[0][1] = bool(s[0] & 1);
        dp[0][2] = bool(s[0] & 2);

        for (int i = 1; i < s.size(); i++) {
            dp[i][0] = max({dp[i - 1][0], dp[i - 1][1], dp[i - 1][2]});
            if (s[i] & 1) {
                dp[i][1] = max(dp[i - 1][1], dp[i - 1][0]) + 1;
            }
            if (s[i] & 2) {
                dp[i][2] = max(dp[i - 1][2], dp[i][0]) + 1;
            }
        }

        ans += *max_element(dp.back().begin(), dp.back().end());
    }

    cout << ans << '\n';
    return 0;
}