#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()
// #define int long long
// #define int unsigned long long
// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>
void open_file(string filename) {
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
// const ll mod = 1e9 + 7;
// const ll mod = 998244353;
const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 3005;
pii v[2 * maxN];
char arr[maxN][maxN];
int dp[maxN][maxN][3];
bool check_horizontal(int x, int y) {
return (arr[x][y - 1] == 'R' && arr[x][y] == 'G' && arr[x][y + 1] == 'W');
}
bool check_vertical(int x, int y) {
return (arr[x - 1][y] == 'R' && arr[x][y] == 'G' && arr[x + 1][y] == 'W');
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> arr[i][j]; v[i + j] = {i, j};
}
} for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
dp[i][j][0] = max({dp[i - 1][j + 1][0], dp[i - 1][j + 1][1], dp[i - 1][j + 1][2]});
dp[i][j][1] = max({dp[i - 1][j + 1][0], dp[i - 1][j + 1][1]}) + check_horizontal(i, j);
dp[i][j][2] = max({dp[i - 1][j + 1][0], dp[i - 1][j + 1][2]}) + check_vertical(i, j);
}
} int ans = 0;
for (int i = 2; i <= n + m; i++) {
int x = v[i].ff, y = v[i].sc;
ans += max({dp[x][y][0], dp[x][y][1], dp[x][y][2]});
} cout << ans;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int t = 1;
// cin >> t;
while (t--) {
solve();
cout << '\n';
}
return 0;
}
