//  {{{

#include <bits/stdc++.h>
using namespace std;

#ifndef ONLINE_JUDGE
#include "debug.cpp"
#else
#define debug(...)
#define debugArr(...)
#endif

using ll = long long;

const int inf = 1073741823;
const ll infl = 1LL << 60;

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; }

#define rep(i, b) for (auto i = 0; i < (b); i++)
#define reps(i, b) for (auto i = 1; i <= (b); i++)

// }}}

int n,r,c;
int subtask1(vector<vector<int>> &mat, int x1, int Y1, int x2, int y2){
    vector<pair<int,int>>d={{-1,0},{0,1},{1,0},{0,-1}};
    queue<pair<int,int>>q;
    vector<vector<int>>dp(r,vector<int>(c,INT_MAX));
    dp[x1][Y1]=0;
    q.push({x1,Y1});
    debug(mat[x1][Y1]);
    //debug(x1,Y1);
    while(q.size())
    {
        int size=q.size();
        for(int i=0;i<size;i++)
        {
            auto temp=q.front();
            q.pop();
            int x=temp.first;
            int y=temp.second;
            for(auto it:d)
            {
                int nx=x+it.first;
                int ny=y+it.second;
                if(nx>=0&&ny>=0&&nx<r&&ny<c&&dp[x][y]+mat[nx][ny]<dp[nx][ny])
                {
                    dp[nx][ny]=dp[x][y]+mat[nx][ny];
                     q.push({nx,ny});
                }
            }
        }
    }
    printf("%d",dp[x2][y2]);
    exit(0);
}

int main() {
    cin >> r >> c >> n;
    vector<vector<int>> mat(r, vector<int>(c));
    int x1, Y1, x2, y2;
    cin >> x1 >> Y1 >> x2 >> y2;
    //printf("%d%d",&x1,&Y1);
    //printf("%d%d",&x2,&y2);
    --x1, --Y1, --x2, --y2;
    //cin >> x1;
    rep(i,r){
        rep(j,c){
            char inp;
            cin >> inp;
            //scanf("%c",&inp);
            if(inp=='#')mat[i][j]=1;
            else mat[i][j] = 0;
        }
    }
    //debug(mat);
    if(n==1){subtask1(mat,x1,Y1,x2,y2);}
}