#include <bits/stdc++.h>
using namespace std;
const int N=6e6+6;
int dx[] = {0,-1,0,1};
int dy[] = {-1,0,1,0};
int R,C,n;
int sx,sy,ex,ey;
string g[N];
struct nd{
	int stp,r,c;
	bool operator < (const nd &y) const{
		if(stp != y.stp) return stp<y.stp;
		return r<=y.r && c<=y.c;
	}
};
vector<nd> Dis[N];
vector<bool> vis[N];
struct nd2{
	int x,y;
	nd dis;
	bool operator < (const nd2 &q) const{
		return q.dis<dis;
	}
};
priority_queue<nd2> q;
int main(){
	scanf("%d%d%d",&R,&C,&n);
	scanf("%d%d%d%d",&sx,&sy,&ex,&ey);
	for(int i=1;i<=R;i++){
		Dis[i].resize(C+1);
		vis[i].resize(C+1);
		cin>>g[i];
		g[i] = ' '+g[i];
		for(int j=1;j<=C;j++)
			Dis[i][j] = nd{R+C+1,0,0};
	}
	//dis[sx][sy] = nd{0,n,n};
	q.push(nd2{sx,sy,nd{0,n,n}});
	vis[sx][sy] = 1;
	while(q.size()){
		int x = q.top().x;
		int y = q.top().y;
		nd dis = q.top().dis;
		q.pop();
	//	printf("%d %d %d %d %d\n",x,y,dis.stp,dis.r,dis.c);
		if(x==ex && y==ey){
			printf("%d\n",dis.stp);
			return 0;
		}
		for(int i=0;i<4;i++){
			int xx = x+dx[i];
			int yy = y+dy[i];
			if(xx>R || yy>C || xx<1 || yy<1) continue;
			nd t;
			if(dis.r==n && dis.c==n){
				if(g[xx][yy]=='.') t = dis;
				else t = nd{dis.stp+1,1,1};
			}
			else{
				t = dis;
				if(dx[i]) t.r++;
				if(dy[i]) t.c++;
				if(t.r>n || t.c>n) continue;
			}
			if(Dis[xx][yy] < t) continue;
			if(t < Dis[xx][yy]) Dis[xx][yy]=t;
			q.push(nd2{xx,yy,t});
		}
	}
	return 0;
}