#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

int main(void) {
  ll R, C, T, SY, SX, GY, GX;
  cin >> R >> C >> T >> SY >> SX >> GY >> GX;
  char B[R][C];
  REP(i, 0, R) REP(j, 0, C) cin >> B[i][j];

  const ll MAX = 40;
  double p[MAX][R][C][R][C];

  ll dd[5] = { 0, 1, 0, -1, 0 };
  REP(i, 0, R) REP(j, 0, C) REP(k, 0, R) REP(l, 0, C) p[0][i][j][k][l] = 0;
  REP(r, 0, R) REP(c, 0, C) if(B[r][c] == '.') {
    ll cnt = 0;
    REP(i, 0, 4) {
      ll nr = r + dd[i], nc = c + dd[i + 1];
      if(0 <= r && r < R && 0 <= c && c < C && B[nr][nc] == '.') cnt++;
    }
    if(cnt > 0) {
      REP(i, 0, 4) {
        ll nr = r + dd[i], nc = c + dd[i + 1];
        if(0 <= r && r < R && 0 <= c && c < C && B[nr][nc] == '.') p[0][r][c][nr][nc] += (double) 1 / cnt;
      }
    } else {
      p[0][r][c][r][c] += 1;
    }
  }

  REP(t, 0, MAX - 1) {
    REP(sr, 0, R) REP(sc, 0, C) REP(gr, 0, R) REP(gc, 0, C) {
      p[t + 1][sr][sc][gr][gc] = 0;
      REP(mr, 0, R) REP(mc, 0, C) p[t + 1][sr][sc][gr][gc] += p[t][sr][sc][mr][mc] * p[t][mr][mc][gr][gc];
    }
  }

  double ans[R][C][R][C];
  REP(i, 0, R) REP(j, 0, C) REP(k, 0, R) REP(l, 0, C) ans[i][j][k][l] = 0;
  ans[SY][SX][SY][SX] = 1;
  REP(t, 0, MAX) if(T & (1LL << t)) {
    double _ans[R][C][R][C];
    REP(sr, 0, R) REP(sc, 0, C) REP(gr, 0, R) REP(gc, 0, C) {
      _ans[sr][sc][gr][gc] = 0;
      REP(mr, 0, R) REP(mc, 0, C) _ans[sr][sc][gr][gc] += ans[sr][sc][mr][mc] * p[t][mr][mc][gr][gc];
    }
    REP(i, 0, R) REP(j, 0, C) REP(k, 0, R) REP(l, 0, C) ans[i][j][k][l] = _ans[i][j][k][l];
  }

  printf("%.15lf\n", ans[SY][SX][GY][GX]);
}