#include<bits/stdc++.h>
//using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++)
#define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--)
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(ll)(key)))
#define pb emplace_back
#define mp std::make_pair
//#define endl "\n"
//
using std::endl;
using std::cin;
using std::cout;
using std::vector;
using std::string;
using std::upper_bound;
using std::lower_bound;
using vi=vector<ll>;
using vii=vector<vi>;
using pii=std::pair<ll,ll>;
//constexpr 
ll MOD=1e9+7;
//constexpr ll MOD=998244353;
//constexpr ll MOD=10000000;
constexpr ll MAX=1e6;
constexpr ll INF=(1ll<<62);
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
struct Segment_tree{
    ll N;
    vector<pii> node;
    Segment_tree(ll sz){
        N=1;
        while(N<sz) N*=2;
        node.resize(2*N-1,mp(INF,INF));
        per(i,N-2,0){
            node[i]=std::min(node[i*2+1],node[i*2+1]);
        }
    }
    void update(ll X,pii val){
        X+=N-1;
        node[X]=val;
        while(X>0){
            X=(X-1)/2;
            node[X]=std::min(node[X*2+1],node[X*2+2]);
        }
    }
    pii RMQ(ll a,ll b,ll now,ll l,ll r){ //[a,b),[l,r)
        if(r<0) r=N;
        if(r<=a||b<=l) return mp(INF,INF);
        if(a<=l&&r<=b) return node[now];
        auto vl=RMQ(a,b,now*2+1,l,(l+r)/2),vr=RMQ(a,b,now*2+2,(l+r)/2,r);
        return std::min(vl,vr);
    }
};
struct Binary_indexed_tree{
    int N;
    vi bit;
    Binary_indexed_tree(int n):N(n){
        bit.resize(N+1,0);
    }
    void add(int x,int a){
        for(x;x<=N;x+=(x&-x)) bit[x]+=a;
    }
    ll sum(int x){
        ll ret=0;
        for(x;x>0;x-=(x&-x)) ret+=bit[x];
        return ret;
    }
    ll lower_bound(ll X){
        if(sum(N)<X) return -1;
        ll ret=0,memo=1,sum=0;
        while(memo*2<=N) memo*=2;
        while(memo>0){
            if(memo+ret<=N&&sum+bit[memo+ret]<X){
                sum+=bit[memo+ret];
                ret+=memo;
            }
            memo/=2;
        }
        return ret+1;
    }
};
struct Union_Find{
    ll N;
    vi par;
    vi siz;
    Union_Find(int n):N(n){
        par.resize(N);
        siz.resize(N,1);
        rep(i,0,N) par[i]=i;
    }
    ll root(ll X){
        if(par[X]==X) return X;
        return par[X]=root(par[X]);
    }
    bool same(ll X,ll Y){
        return root(X)==root(Y);
    }
    void unite(ll X,ll Y){
        X=root(X);
        Y=root(Y);
        if(X==Y) return;
        par[X]=Y;
        siz[Y]+=siz[X];
        siz[X]=0;
    }
    ll size(ll X){
        return siz[root(X)];
    }
};
long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}
vi fac,finv,inv;
void COMinit() {
    fac.resize(MAX);
    finv.resize(MAX);
    inv.resize(MAX);
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
ll COM(ll n,ll r){
    if(n<r||n<0||r<0) return 0;
    return fac[n]*finv[r]%MOD*finv[n-r]%MOD;
}
int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll H,W,K; cin>>H>>W>>K;
    vector<std::set<ll>> rowha(H),colha(W),rowwa(H),colwa(W),gyakucolha(W),gyakurowha(H);
    ll SX,SY,GX,GY; cin>>SX>>SY>>GX>>GY;
    SX--,SY--,GX--,GY--;
    vector<string> S(H);
    rep(i,0,H) cin>>S[i];
    rep(i,0,H){
        rowha[i].insert(-INF);
        rowha[i].insert(INF);
        rowwa[i].insert(-INF);
        rowwa[i].insert(INF);
        gyakurowha[i].insert(INF+1);
        gyakurowha[i].insert(-INF);
        rep(j,0,W){
            if(S[i][j]=='@') rowha[i].insert(j),gyakurowha[i].insert(INF-j);
            else rowwa[i].insert(j);
        }
    }
    rep(i,0,W){
        colwa[i].insert(INF);
        colwa[i].insert(-INF);
        colha[i].insert(INF);
        colha[i].insert(-INF);
        gyakucolha[i].insert(INF+1);
        gyakucolha[i].insert(-INF);
        rep(j,0,H){
            if(S[j][i]=='@') colha[i].insert(j),gyakucolha[i].insert(INF-j);
            else colwa[i].insert(j);
        }
    }
    std::queue<pii> que;
    que.push(mp(SX,SY));
    que.push(mp(-1,-1));
    ll count=0;
    rowwa[SX].erase(SY);
    colwa[SY].erase(SX);
    while(que.size()>1){
        ll X=que.front().first,Y=que.front().second; que.pop();
        if(X==-1){
            count++;
            que.push(mp(-1,-1));
            continue;
        }
        if(X==GX&&Y==GY){
            cout<<count<<endl;
            return 0;
        }
        auto it=gyakurowha[X].upper_bound(INF-Y);
        ll p=*it;
        p=INF-p;
        ll minrow=std::max({0ll,p,Y-K});
        it=rowha[X].lower_bound(Y);
        p=*it;
        ll maxrow=std::min({W-1,p,Y+K});
        auto q=rowwa[X].lower_bound(minrow);
        vi x;
        while(1){
            ll r=*q;
            if(r>maxrow) break;
            x.pb(r);
            que.push(mp(X,r));
            q++;
        }
        rep(i,0,x.size()) rowwa[X].erase(x[i]);
        std::swap(X,Y);
        it=gyakucolha[X].upper_bound(INF-Y);
        p=*it;
        p=INF-p;
        ll mincol=std::max({0ll,p,Y-K});
        it=colha[X].upper_bound(Y);
        p=*it;
        ll maxcol=std::min({H-1,p,Y+K});
        q=colwa[X].lower_bound(mincol);
        vi y;
        while(1){
            ll r=*q;
            if(r>maxcol) break;
            y.pb(r);
            que.push(mp(r,X));
            q++;
        }
        rep(i,0,y.size()) colwa[X].erase(y[i]);
    }
    cout<<-1<<endl;
}


Measured memory_bytes: 520836