using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cstdio>

#define pb push_back
#define sz size
#define f first
#define s second
#define II inline
#define ll long long
#define db double
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define all(v) v.begin() , v.end()
#define CC(v) memset((v),0,sizeof((v)))
#define CP(v,w) memcpy((v),(w),sizeof((w)))
#define mp make_pair


typedef vector<int> VI;
typedef pair<int,int> pi;
typedef vector<string> VS;

#define IN "kdrum.in"
#define OUT "kdrum.out"
#define N_MAX 1<<6

int N,M,K,X1,Y1,X2,Y2;
int V[N_MAX][N_MAX];
int A[N_MAX][N_MAX][N_MAX];
int divv[8],nr[8],D[N_MAX][N_MAX][8];
int stv[1<<7],poz[1<<14];
int nrd[1<<6][8];

II int pow(int x,int y)
{
	int rez(1);
	FOR(i,1,y)
		rez *= x;
	return rez;
}

II void scan()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	scanf("%d %d %d\n",&N,&M,&K);
	scanf("%d %d %d %d\n",&X1,&Y1,&X2,&Y2);
	FOR(i,1,N)
	FOR(j,1,M)
		scanf("%d",&V[i][j]);
}

II void compute()
{
	int aux = K;
	for(int i=2;i*i<=aux;++i)
	{
		if(aux % i)
			continue;
		divv[++divv[0]] = i;
		for(;!(aux % i);aux /= i,++nr[divv[0]]);
	}
	if(aux > 1)
	{	
		divv[++divv[0]] = aux;
		nr[divv[0]] = 1;
	}
	aux = K;
	FOR(i,2,K)
		if(!(aux % i))
		{	
			stv[++stv[0]] = i;
			poz[i] = stv[0];
			
			aux = i;
			FOR(k,1,divv[0])
			{
				for(;!(aux % divv[k]);aux /= divv[k],++nrd[stv[0]][k]);
				nrd[stv[0]][k] = min(nrd[stv[0]][k],nr[k]);
			}	
			aux = K;
		}	
	
	FOR(i,1,N)
	FOR(j,1,M)
	{
		aux = V[i][j];
		if(!aux)
			continue;
		FOR(k,1,divv[0])
		for(;!(aux % divv[k]);aux /= divv[k],++D[i][j][k]);
		
		aux = 1;
		FOR(k,1,divv[0])
			aux *= pow(divv[k],min(nr[k],D[i][j][k]) );
	}	
}

II void solve()
{
	memset(A,100,sizeof(A));
	int aux;
	A[X1][Y1][ poz[ V[1][1] ] ] = 1;
	int nr2[16],off(stv[0]);
	stv[0] = 0;
	
	for(;A[X2][Y2][ poz[K] ] > 1<<20;)
	{
		FOR(i,1,N)
		FOR(j,1,N)
		FOR(k,0,off)
		{
			if(A[i][j][k]>1<<20 || !V[i][j])
				continue;
			
			//jos
			if(i!=1 && V[i-1][j])
			{
				aux = max(1,stv[k]);
				CC(nr2);
				aux *= V[i-1][j];
				
				FOR(kk,1,divv[0])
				for(;!(aux % divv[kk]);aux /= divv[kk],++nr2[kk]);
		
				aux = 1;
				FOR(kk,1,divv[0])
					aux *= pow(divv[kk], min(nr[kk],nr2[kk]) );
				A[i-1][j][ poz[aux] ] = min(A[i-1][j][ poz[aux] ],A[i][j][k] + 1);
			}	
			
			//sus
			if(i!=N && V[i+1][j])
			{
				aux = max(1,stv[k]);
				CC(nr2);
				aux *= V[i+1][j];
				
				FOR(kk,1,divv[0])
				for(;!(aux % divv[kk]);aux /= divv[kk],++nr2[kk]);
		
				aux = 1;
				FOR(kk,1,divv[0])
					aux *= pow(divv[kk], min(nr[kk],nr2[kk]) );
				A[i+1][j][ poz[aux] ] = min(A[i+1][j][ poz[aux] ],A[i][j][k] + 1);

			}	
			//dreapta
			if(j!=M && V[i][j+1])
			{
				aux = max(1,stv[k]);
				CC(nr2);
				aux *= V[i][j+1];
				
				FOR(kk,1,divv[0])
				for(;!(aux % divv[kk]);aux /= divv[kk],++nr2[kk]);
		
				aux = 1;
				FOR(kk,1,divv[0])
					aux *= pow(divv[kk], min(nr[kk],nr2[kk]) );
				A[i][j+1][ poz[aux] ] = min(A[i][j+1][ poz[aux] ] ,A[i][j][k] + 1);	
			}	
			
			//stanga
			if(j!=1 && V[i][j-1])
			{
				aux = max(1,stv[k]);
				CC(nr2);
				aux *= V[i][j-1];
				
				FOR(kk,1,divv[0])
				for(;!(aux % divv[kk]);aux /= divv[kk],++nr2[kk]);
		
				aux = 1;
				FOR(kk,1,divv[0])
					aux *= pow(divv[kk], min(nr[kk],nr2[kk]) );
				A[i][j-1][ poz[aux] ] = min(A[i][j-1][ poz[aux] ],A[i][j][k] + 1);
				
			}
		}
	}
	printf("%d\n",A[X2][Y2][off]);
}

int main()
{
	scan();
	compute();
	solve();
	return 0;
}