//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>
using namespace std;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
typedef long long ll;
typedef long double ld;
const ll SZ = 3050;
char grid[SZ][SZ];
int main() {
fastInp;
ll n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < m; j++) grid[i][j] = s[j];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (grid[i][j] == 'R') {
if (grid[i][j + 1] == 'G' && grid[i][j + 2] == 'W') {
grid[i][j] = '0';
grid[i][j + 1] = '0';
grid[i][j + 2] = '0';
ans++;
continue;
}
}
if (grid[i][j] == 'W') {
if (i >= 2 && grid[i - 2][j] == 'R' && grid[i - 1][j] == 'G') {
grid[i][j] = '0';
grid[i - 1][j] = '0';
grid[i - 2][j] = '0';
ans++;
continue;
}
}
}
}
cout << ans;
return 0;
}
