#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
vector<vector<double>> matrixmul(int l, int m, int n, vector<vector<double>> a, vector<vector<double>> b){
	vector<vector<double>> c;
	for(int i=0; i<l; i++){
		vector<double> v;
		for(int j=0; j<n; j++){
			double x=0;
			for(int k=0; k<m; k++){
				x+=(a[i][k]*b[k][j]);
			}
			v.push_back(x);
		}
		c.push_back(v);
	}
	return c;
}
vector<vector<double>> matrixpow(int n, vector<vector<double>> a, ll k){
	vector<vector<double>> ap=a, ans;
	for(int i=0; i<n; i++){
		vector<double> v;
		for(int j=0; j<n; j++){
			if(i==j){
				v.push_back(1);
			}else{
				v.push_back(0);
			}
		}
		ans.push_back(v);
	}
	while(k){
		if(k&1) ans=matrixmul(n, n, n, ap, ans);
		ap=matrixmul(n, n, n, ap, ap);
		k>>=1;
	}
	return ans;
}
int main()
{
	int r, c; ll t;
	cin>>r>>c>>t;
	int sy, sx, gy, gx;
	cin>>sy>>sx>>gy>>gx;
	string b[10];
	for(int i=0; i<r; i++) cin>>b[i];
	int dx[4]={1, 0, -1, 0}, dy[4]={0, 1, 0, -1};
	vector<vector<double>> a;
	for(int i=0; i<r; i++){
		for(int j=0; j<c; j++){
			vector<double> v;
			if(b[i][j]=='#'){
				for(int k=0; k<r*c; k++){
					v.push_back(0);
				}
				a.push_back(v);
				continue;
			}
			double ct=0;
			for(int k=0; k<4; k++){
				if(b[i+dx[k]][j+dy[k]]!='#') ct+=1;
			}
			if(ct==0){
				for(int k=0; k<r*c; k++){
					if(k==i*c+j) v.push_back(1);
					else v.push_back(0);
				}
				a.push_back(v);
				continue;
			}
			for(int k=0; k<r*c; k++){
				if(((abs(k/c-i)==1 && k%c==j) || (abs(k%c-j)==1 && k/c==i)) && b[k/c][k%c]!='#'){
					v.push_back(1/ct);
				}else{
					v.push_back(0);
				}
			}
			a.push_back(v);
		}
	}
	a=matrixpow(r*c, a, t);
	printf("%.7lf\n", a[sy*c+sx][gy*c+gx]);
	return 0;
}