#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll H, W, K;
  ll x1, y1, x2, y2;
  cin >> H >> W >> K;
  cin >> x1 >> y1 >> x2 >> y2;
  x1--;
  y1--;
  x2--;
  y2--;
  vector<string> C(H);
  REP(i, H) cin >> C[i];

  vvl DP = VVL(H * W + 1, 4, llINF);
  priority_queue<tuple<ll, ll, ll, ll>, vector<tuple<ll, ll, ll, ll>>,
                 greater<tuple<ll, ll, ll, ll>>>
      Q;

  Q.push({0, x1, y1, -1});

  map<pll, ll> M;
  M[{1, 0}] = 0;
  M[{0, 1}] = 1;
  M[{-1, 0}] = 2;
  M[{0, -1}] = 3;

  while (!Q.empty()) {
    auto q = Q.top();
    Q.pop();
    ll cost = get<0>(q);
    ll x = get<1>(q);
    ll y = get<2>(q);
    ll dir = get<3>(q);
    if (dir != -1 && DP[x * W + y][dir] <= cost)
      continue;
    if (dir != -1)
      DP[x * W + y][dir] = cost;
    REP(k, 4) {
      if (x + dx[k] >= 0 && x + dx[k] < H && y + dy[k] >= 0 && y + dy[k] < W &&
          C[x + dx[k]][y + dy[k]] == '.') {
        if (dir == M[{dx[k], dy[k]}])
          Q.push({cost + 1, x + dx[k], y + dy[k], M[{dx[k], dy[k]}]});
        else
          Q.push({1 + (((cost + K - 1) / K) * K), x + dx[k], y + dy[k],
                  M[{dx[k], dy[k]}]});
      }
    }
  }
  ll ans = llINF;
  REP(i, 4) ans = min(ans, DP[x2 * W + y2][i]);
  if (ans == llINF)
    cout << -1 << endl;
  else
    cout << (ans + K - 1) / K << endl;

  return 0;
}


Measured memory_bytes: 107668