#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define in insert
#define pb push_back
#define pll pair<ll,ll>
ll n;
ll m;
bool To_The_Right(vector<vector<char>>&v,vector<vector<bool>>&used,ll i,ll j){
if(v[i][j]=='R' && v[i][j+1]=='G' && v[i][j+2]=='W' && !used[i][j] && !used[i][j+1] && !used[i][j+2]){
used[i][j]=1;
used[i][j+1]=1;
used[i][j+2]=1;
return 1;
}
return 0;
}
bool To_The_Bottom(vector<vector<char>>&v,vector<vector<bool>>&used,ll i,ll j){
if(v[i][j]=='R' && v[i+1][j]=='G' && v[i+2][j]=='W' && !used[i][j] && !used[i+1][j] && !used[i+2][j]){
used[i][j]=1;
used[i+1][j]=1;
used[i+2][j]=1;
return 1;
}
return 0;
}
void solve(){
cin>>n>>m;
vector<vector<char>>v(n+5,vector<char>(m+5,'.'));
vector<vector<bool>>used(n+5,vector<bool>(m+5,0));
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin>>v[i][j];
}
}
ll ans=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(v[i][j]!='R'){
continue;
}
if(To_The_Bottom(v,used,i,j) || To_The_Right(v,used,i,j)){
ans++;
}
}
}
cout<<ans;
}
int main(){
solve();
return 0;
}
