#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

template<typename T> struct Matrix{
    int r,c;
    vector<vector<T>> a;
    Matrix(int r, int c, T init = 0) : r(r), c(c), a(r, vector<T>(c, init)) {}
    
    Matrix& unit(){
        assert(r == c);
        rep(i,r) a[i][i] = 1;
        return *this;
    }

    const vector<T>& operator[] (int i) const {return a[i];}
    vector<T>& operator[] (int i) {return a[i];}

    Matrix operator* (const Matrix& b) const{
        assert(c == b.r);
        Matrix res(r, b.c);
        rep(i,r)rep(k,c)rep(j,b.c) res[i][j] += a[i][k] * b[k][j];
        return res;
    }

    Matrix pow(ll k) const{
        assert(r == c);
        Matrix now = *this;
        Matrix res = Matrix(r,c).unit();
        while(k){
            if(k & 1) res = res * now;
            now = now * now;
            k >>= 1;
        }
        return res;
    }
};

using mat = Matrix<double>;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int r,c,t; in(r,c,t);
    int a = (r-1)*(c-1);
    int sy,sx,gy,gx; in(sy,sx,gy,gx);
    string b[r]; rep(i,r) in(b[i]);

    auto f = [&](int x, int y) -> int{
        return (x-1)*(c-1) + y-1;
    };

    mat m(a,a);
    FOR(i,1,r-1){
        FOR(j,1,c-1){
            if(b[i][j] == '#') continue;
            int cnt = 0;
            rep(k,4){
                int ni = i + dx[k];
                int nj = j + dy[k];
                if(b[ni][nj] == '.') cnt++;
            }
            if(cnt == 0){
                m[f(i,j)][f(i,j)] += 1.0;
            }
            else{
                rep(k,4){
                    int ni = i + dx[k];
                    int nj = j + dy[k];
                    if(b[ni][nj] == '.') m[f(ni,nj)][f(i,j)] += 1.0 / cnt;
                }
            }
        }
    }

    mat v(a,1);
    v[f(sy,sx)][0] = 1.0;
    v = m.pow(t) * v;
    printf("%.12f\n", v[f(gy,gx)][0]);
}