#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define ff first
#define ss second
#define N 3005
#define MOD 1000000007
char c[N][N];
bool in[N][2];
int dp[N][4];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin>>n>>m;
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= m; ++j){
cin>>c[i][j];
}
}
int res = 0;
for(int s = 2; s <= n + m; ++s){
for(int i = max(1, s - m); i <= min(n, s - 1); ++i){
if(c[i][s - i] == 'R' && c[i][s - i + 1] == 'G' && c[i][s - i + 2] == 'W'){
in[i][0] = 1;
}
if(c[i][s - i] == 'R' && c[i + 1][s - i] == 'G' && c[i + 2][s - i] == 'W'){
in[i][1] = 1;
}
}
memset(dp[max(1, s - m) - 1], 0, sizeof dp[max(1, s - m) - 1]);
for(int i = max(1, s - m); i <= min(n, s - 1); ++i){
memset(dp[i], 0, sizeof dp[i]);
for(int j = 0; j < 4; ++j)
dp[i][j / 2] = max(dp[i][j / 2], dp[i - 1][j]);
if(in[i][1]){
for(int j = 0; j < 4; ++j)
dp[i][j / 2 + 2] = max(dp[i][j / 2 + 2], dp[i - 1][j] + 1);
}
if(in[i][0])
dp[i][0] = max(dp[i - 1][0] + 1, dp[i][0]);
}
res += max(max(dp[min(n, s - 1)][0], dp[min(n, s - 1)][1]), max(dp[min(n, s - 1)][2], dp[min(n, s - 1)][3]));
for(int i = max(1, s - m); i <= min(n, s - 1); ++i){
in[i][0] = in[i][1] = 0;
}
}
cout<<res;
}
