#pragma GCC optimization ("O3")

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;

#define INF (1LL<<61)
#define MOD 1000000007LL 
//#define MOD 998244353LL
#define EPS (1e-10)

#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORE(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((ll)(x).size())
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) {ASC((x)); REV((x));}
#define BIT(s,i) (((s)>>(i))&1)
#define pb push_back
#define fi first
#define se second

template<class T> inline int chmin(T& a, T b) {if(a>b) {a=b; return 1;} return 0;}
template<class T> inline int chmax(T& a, T b) {if(a<b) {a=b; return 1;} return 0;}
class mint {
public:
    ll x;
    mint(ll x=0) : x((x%MOD+MOD)%MOD) {}
    mint operator-() const {return mint(-x);}
    mint& operator+=(const mint& a) {if((x+=a.x)>=MOD) x-=MOD; return *this;}
    mint& operator-=(const mint& a) {if((x+=MOD-a.x)>=MOD) x-=MOD; return *this;}
    mint& operator*=(const mint& a) {(x*=a.x)%=MOD; return *this;}
    mint operator+(const mint& a) const {mint b(*this); return b+=a;}
    mint operator-(const mint& a) const {mint b(*this); return b-=a;}
    mint operator*(const mint& a) const {mint b(*this); return b*=a;}
    mint pow(ll t) const {if(!t) return 1; mint a=pow(t>>1); return (t&1?*this*a:a)*a;}
    mint inv() const {return pow(MOD-2);}
    mint& operator/=(const mint& a) {return *this*=a.inv();}
    mint operator/(const mint& a) const {mint b(*this); return b/=a;}
};
istream &operator>>(istream& is, mint& a) {ll t; is>>t; a=t; return is;}
ostream &operator<<(ostream& os, const mint& a) {return os<<a.x;}
using mvec = vector<mint>;
using mmat = vector<mvec>;

using dvec = vector<long double>;
using dmat = vector<dvec>;

dmat matmul(dmat A, dmat B)
{
    ll N = SZ(A);
    dmat C(N, dvec(N));
    REP(i,0,N) {
        REP(j,0,N) {
            REP(k,0,N) C[i][j] += A[i][k]*B[k][j];
        }
    }
    return C;
}

dmat matpow(dmat A, ll n)
{
    if(n == 0) {
        ll N = SZ(A);
        dmat I(N, dvec(N));
        REP(i,0,N) I[i][i] = 1.0;
        return I;
    }
    dmat T = matpow(A, n>>1);
    T = matmul(T, T);
    if(n&1) T = matmul(T, A);
    return T; 
}

int main()
{
    ll R, C, T, SY, SX, GY, GX;
    cin >> R >> C >> T >> SY >> SX >> GY >> GX;
    vector<string> B(R);
    REP(i,0,R) cin >> B[i];

    ll M = R*C;
    dmat A(M, dvec(M));
    vector<pll> D = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
    REP(i,1,R-1) {
        REP(j,1,C-1) {
            if(B[i][j] == '#') continue;
            ll c = 0;
            FORE(d,D) c += (B[i+d.fi][j+d.se] == '.');
            if(c) {
                FORE(d,D) {
                    ll ni = i+d.fi, nj = j+d.se;
                    if(B[ni][nj] == '.') A[i*C+j][ni*C+nj] = 1.0/c;
                }
            }
            else A[i*C+j][i*C+j] = 1.0;
        }
    }

    A = matpow(A, T);
    cout << setprecision(12) << A[SY*C+SX][GY*C+GX] << endl;

    return 0;
}

/*



*/