#include <iostream>
#include <vector>
using namespace std;
int n, m;
vector<string> g;
vector<pair<int, int>> getDiagonalCoords(int i, int j) {
vector<pair<int, int>> ret;
while (i < n and j > -1) {
ret.push_back({i, j});
i++, j--;
}
return ret;
}
int solve(int bad, int idx, vector<vector<int>> &dp, vector<pair<int, int>> &coords) {
if (idx >= coords.size()) return 0;
if (dp[bad][idx] != -1) return dp[bad][idx];
int i = coords[idx].first, j = coords[idx].second;
int &ret = dp[bad][idx];
ret = solve(max(0, bad - 1), idx + 1, dp, coords);
if (i + 2 < n and g[i][j] == 'R' and g[i + 1][j] == 'G' and g[i + 2][j] == 'W') {
ret = max(ret, 1 + solve(2, idx + 1, dp, coords));
}
if (not bad and j + 2 < m and g[i][j] == 'R' and g[i][j + 1] == 'G' and g[i][j + 2] == 'W') {
ret = max(ret, 1 + solve(0, idx + 1, dp, coords));
}
return ret;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
g.resize(n);
for (int i = 0; i < n; i++) {
cin >> g[i];
}
int ans = 0;
for (int j = 0; j < m; j++) {
vector<pair<int, int>> coords = getDiagonalCoords(0, j);
vector<vector<int>> dp(3, vector<int>(coords.size(), -1));
ans += solve(0, 0, dp, coords);
}
for (int i = 1; i < n; i++) {
vector<pair<int, int>> coords = getDiagonalCoords(i, m - 1);
vector<vector<int>> dp(3, vector<int>(coords.size(), -1));
ans += solve(0, 0, dp, coords);
}
cout << ans << '\n';
return 0;
}
