#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using P = pair<int, int>;
#define all(x) x.begin(), x.end()
#define rep(x,s,e) for (auto x=(s)-((s)>(e));x!=(e)-((s)>(e));((s)<(e)?x++:x--))
#define sz(x) (int)x.size()
const char nl = '\n';
vector<string> a;
//bool c1(int i, int j) {
//bool ok = false;
//rep(gos, 0, 3)
//ok |= vis[i+gos][j];
//return !ok;
//}
bool c3(int i, int j) {
return a[i][j] == 'R' && a[i][j+1] == 'G' && a[i][j+2] == 'W';
}
bool c2(int i, int j) {
return a[i][j] == 'R' && a[i+1][j] == 'G' && a[i+2][j] == 'W';
}
void solve() {
int n, m; cin >> n >> m;
a.resize(n);
for (auto &i: a)cin >> i;
int vis[n][m];
memset(vis, 0, sizeof vis);
int cnt = 0;
rep(i, 0, n) {
rep(j, 0, m) {
if (i<n-2 && c2(i, j))cnt += 1;
if (j<m-2 && c3(i, j))cnt += 1;
}
}
assert(cnt <= 16);
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
//RRRGW
//RRGRR
//RGWWR
