using namespace std;

#include <queue>
#include <algorithm>  
#define pb push_back
#define sz size
#define f first
#define s second
#define II inline
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define mp make_pair
#define IN "kdrum.in"
#define OUT "kdrum.out"
#define N_MAX 1<<6

typedef pair<int,int> pi;
int N,M,K,X1,Y1,X2,Y2;
int V[N_MAX][N_MAX];
short int A[N_MAX][N_MAX][1<<7];
int nr,stv[1<<8],poz[1<<14];

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

vector< pair<int,pi> > Q;

II void solve()
{
	int aux = K;
	stv[0] = 1;
	FOR(i,2,K)
		if(!(aux % i))
		{	
			stv[++nr] = i;
			poz[i] = nr;
		}	
	
	memset(A,64,sizeof(A));
	A[X1][Y1][ poz[__gcd(V[X1][Y1],K) ] ] = 1;
	Q.pb( mp(poz[__gcd(V[X1][Y1],K) ],mp(X1,Y1)) );
	
	for(int ii=0;;++ii)
	{
		int i = Q[ii].s.f;
		int j = Q[ii].s.s;
		int k = Q[ii].f;
		int val = A[i][j][k]+1;
		if(A[i][j][k] > 1<<14 || !V[i][j])
			continue;
		if(X2 == i && Y2 == j && poz[K]==k)
			break;
		
		if(i!=1 && V[i-1][j])
		{
			aux = poz[__gcd(stv[k] * V[i-1][j],K)];
			if(A[i-1][j][aux] > val)
				A[i-1][j][aux] = val,
				Q.pb( mp(aux,mp(i-1,j)) );
		}	
		if(i!=N && V[i+1][j])
		{
			aux = poz[__gcd(stv[k] * V[i+1][j],K)];
			if(A[i+1][j][aux] > val)
				A[i+1][j][aux] = val,
				Q.pb( mp(aux,mp(i+1,j)) );
		}
		if(j!=1 && V[i][j-1])
		{	
			aux = poz[__gcd(stv[k] * V[i][j-1],K)]; 
			if(A[i][j-1][aux] > val)
				A[i][j-1][aux] = val,
				Q.pb( mp(aux,mp(i,j-1)) );
		}
		if(j!=M && V[i][j+1])
		{
			aux = poz[__gcd(stv[k] * V[i][j+1],K)];
			if(A[i][j+1][aux] > val)
				A[i][j+1][aux] = val,
				Q.pb( mp(aux,mp(i,j+1)) );
		}	
	}
	printf("%d\n",A[X2][Y2][poz[K]]);
}

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