#include <bits/stdc++.h>
using namespace std;
const int N = 3e3+10;
char ta[N][N];
int dp[N][N][3], R, C;
int main(void){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> R >> C;
for(int i = 1; i <= R; i++){
for(int j = 1; j <= C; j++){
cin >> ta[i][j];
}
}
int ans = 0;
for(int i = 1; i <= R; i++){
for(int j = 1; j <= C; j++){
dp[i][j][0] = max({dp[i-1][j+1][0], dp[i-1][j+1][1], dp[i-1][j+1][2]});
if(ta[i][j-1] == 'R' and ta[i][j] == 'G' and ta[i][j+1] == 'W') dp[i][j][1] = 1 + max(dp[i-1][j+1][0], dp[i-1][j+1][1]);
if(ta[i-1][j] == 'R' and ta[i][j] == 'G' and ta[i+1][j] == 'W') dp[i][j][2] = 1 + max(dp[i-1][j+1][0], dp[i-1][j+1][2]);
if(j == 1 or i == R) ans += max({dp[i][j][0], dp[i][j][1], dp[i][j][2]});
}
}
cout << ans << "\n";
return 0;
}
