#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define deb(x...) 42
#endif

#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

#define MOD 1000000007


ll n,m,t;
vector<string> a;
bool sol(int i,int j,int d,vector<string> &vis){
    if(i<0||j<0||i>=n||j>=m||a[i][j]=='#'||d>t){
        return false;
    }
    if(vis[i][j]=='V'){
        return false;
    }
    if(a[i][j]=='E'){
        return d<=t;;
    }
    vis[i][j]='V';
    bool ans=false;
    ans|=sol(i+1,j,d+1,vis);
    ans|=sol(i-1,j,d+1,vis);
    ans|=sol(i,j+1,d+1,vis);
    ans|=sol(i,j-1,d+1,vis);
    return ans;
}

void solve() {
    cin>>n>>m>>t;
    a.resize(n);
    for(ll i=0;i<n;i++) {
        cin>>a[i];
    }
    ll ans=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(a[i][j]=='P'){
                vector<string>vis;
                vis=a;
                ans+=sol(i,j,0,vis);
            }
        }
    }
    cout<<ans<<endl;

}


int main() {
  fast_io;
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  freopen("output.txt", "w", stderr);
#endif
  ll t = 1;
  // cin >> t;
  for(ll i = 0; i < t; i++) {
#ifdef LOCAL
    cout << "CASE " << i + 1 << ":\n";
#endif
    solve();
  }
#ifdef LOCAL
  cout << endl << "Finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n\n";
#endif
  return 0;
}