BFS AC
//
// GGGGGGGGGGGGG CCCCCCCCCCCCC AAA
// GGG::::::::::::G CCC::::::::::::C A:::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::::A
// G:::::G GGGGGG C:::::C CCCCCC A:::::::::A
//G:::::G C:::::C A:::::A:::::A
//G:::::G C:::::C A:::::A A:::::A
//G:::::G GGGGGGGGGGC:::::C A:::::A A:::::A
//G:::::G G::::::::GC:::::C A:::::A A:::::A
//G:::::G GGGGG::::GC:::::C A:::::AAAAAAAAA:::::A
//G:::::G G::::GC:::::C A:::::::::::::::::::::A
// G:::::G G::::G C:::::C CCCCCC A:::::AAAAAAAAAAAAA:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::A A:::::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A A:::::A
// GGG::::::GGG:::G CCC::::::::::::C A:::::A A:::::A
// GGGGGG GGGG CCCCCCCCCCCCCAAAAAAA AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define debug(...) printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define gettime() end\_time=clock();printf("now running time is %.7f\\n",(float)(end\_time - start\_time)/CLOCKS\_PER\_SEC);
#else
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 55
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define X first
#define Y second
#define Set\_oo 0x3f
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
clock\_t start\_time=clock(), end\_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int nx,ny;
char mz\[M\]\[M\];
int used\[M\]\[M\];
int bx,by;
int dx\[\]={1,-1,0,0};
int dy\[\]={0,0,1,-1};
int bfs(){
queue<PII> q;
q.push(PII(bx,by));
int ans=0;
used\[bx\]\[by\]=1;
while(!q.empty()){
int x=q.front().X;
int y=q.front().Y;
if(mz\[y\]\[x\]=='G')ans++;
// debug("%d %d\\n",x,y);
q.pop();
int j=0;
for(;j<4;j++){
int chx=x+dx\[j\],chy=y+dy\[j\];
if(mz\[chy\]\[chx\]=='T')break;
}
if(j<4)continue;
for(int i=0;i<4;i++){
int nex=x+dx\[i\],ney=y+dy\[i\];
if(nex<0||nex>=nx||ney<0||ney>=ny)continue;
if(mz\[ney\]\[nex\]=='#')continue;
if(used\[nex\]\[ney\])continue;
used\[nex\]\[ney\]=1;
q.push(PII(nex,ney));
}
}
return ans;
}
void solve(){
Set(used,0);
printf("%d\\n",bfs());
}
int main() {
ios\_base::sync\_with\_stdio(0);
while(~scanf("%d%d",&nx,&ny)){
for(int i=0;i<ny;i++){
scanf("%s",mz\[i\]);
for(int j=0;j<nx;j++){
if(mz\[i\]\[j\]=='P')bx=j,by=i;
}
}
solve();
}
}