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

II int gcd(int x, int y)  
{  
    for(int aux;y;)  
    {  
        aux = x%y;  
        x = y;  
        y = aux;  
    }  
    return x;  
}  

II void compute()
{
	int aux = K;
	aux = K;
	stv[0] = 1;
	FOR(i,2,K)
		if(!(aux % i))
		{	
			stv[++nr] = i;
			poz[i] = nr;
		}	
}

II void solve()
{
	int aux;
	memset(A,100,sizeof(A));
	A[X1][Y1][ poz[ gcd(V[X1][Y1],K) ] ] = 1;
	
	for(;A[X2][Y2][ poz[K] ] > 1<<20;)
	{
		FOR(i,1,N)
		FOR(j,1,N)
		{
			if(!V[i][j] || A[X2][Y2][ poz[K] ] < 1<<20)
				continue;
		FOR(k,0,nr)
		{
			if(A[i][j][k] > 1<<20)
				continue;
			
			if(i!=1 && V[i-1][j])
			{
				aux = poz[gcd(stv[k] * V[i-1][j],K)];
				A[i-1][j][aux] = min(A[i-1][j][aux],A[i][j][k]+1);
			}	
			if(i!=N && V[i+1][j])
			{
				aux = poz[gcd(stv[k] * V[i+1][j],K)];
				A[i+1][j][aux] = min(A[i+1][j][aux],A[i][j][k]+1);
			}
			if(j!=1 && V[i][j-1])
			{	
				aux = poz[gcd(stv[k] * V[i][j-1],K)]; 
				A[i][j-1][aux] = min(A[i][j-1][aux],A[i][j][k]+1);
			}
			if(j!=M && V[i][j+1])
			{
				aux = poz[gcd(stv[k] * V[i][j+1],K)];
				A[i][j+1][aux] = min(A[i][j+1][aux],A[i][j][k]+1);
			}	
		}
		}
	}	
	printf("%d\n",A[X2][Y2][poz[K]]);
}

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