#include <cstdio>
#include <cstdlib>
#include <list>
#define INF 3000000
using namespace std;

int N, M, K;
int sx, sy, ex, ey;

int dx[] = { 0, -1 ,0, 1};
int dy[] = {-1,  0, 1, 0};

int mat[52][52][400];
int inps[52][52];
int divs[400];

struct point
{
    int x;
    int y;
    int p;
};

list<point> Q;

int gcd(int a, int b)
{
    if (!b) return a;
    return gcd(b, a % b);
}

int find(int x, int n)
{
    for(int i = 0; i < n; i++)
    {
        if(divs[i] == x)
        {
            return i;
        }
    }
    return -1;
}


int main()
{

    for(int i = 0; i < 52; i++)
    {
        for(int j = 0; j < 52; j++)
        {
            for(int k = 0; k < 400; k++)
            {
                mat[i][j][k] = INF-1;
            }
        }
    }
    freopen("kdrum.in", "r", stdin);
    freopen("kdrum.out", "w", stdout);
    scanf("%d %d %d", &N, &M, &K);
    scanf("%d %d %d %d", &sx, &sy, &ex, &ey);

    for(int i = 0; i <= N+1; i++)
    {
        inps[i][M+1] = INF;
        inps[i][0] = INF;
    }

    for(int i = 0; i <= M+1; i++)
    {
        inps[0][i] = INF;
        inps[N+1][i] = INF;
    }

    int div_count = 0;
    for(int i = 1; i < (K/2)+1; i++)
    {
        if(K%i == 0)
        {
            divs[div_count++] = i;
        }
    }
    divs[div_count++] = K;

    for(int i = 1; i <= N; i++)
    {
        for(int j = 1; j <= M; j++)
        {
            scanf("%d", &inps[i][j]);
        }
    }

    point p;
    p.x = sx;
    p.y = sy;
    if((K % inps[sx][sy]) == 0)
    {
        p.p = find(inps[sx][sy], div_count);
    }
    else
    {
        p.p = 0;
    }

    mat[p.x][p.y][p.p] = 1;
    Q.push_back(p);
    while(!Q.empty())
    {
        point scos;
        scos = Q.front();
        Q.pop_front();
        //printf("%d %d %d\n", scos.x, scos.y, scos.p);
        for(int i = 0; i < 4; i++)
        {
            if((inps[scos.x + dx[i]][scos.y + dy[i]] < INF) && (inps[scos.x + dx[i]][scos.y + dy[i]] != 0))
            {
                point temp;
                temp.x = scos.x + dx[i];
                temp.y = scos.y + dy[i];
                //printf("---%d %d\n", temp.x, temp.y);
                //printf("DIVIDER: %d\n", gcd(inps[temp.x][temp.y], K));
				if(gcd(inps[temp.x][temp.y], K) == inps[temp.x][temp.y])
                {
					//printf("EQUEL\n");
					temp.p = find(gcd(divs[scos.p] * inps[temp.x][temp.y], K), div_count);
				}
				else
				{
					temp.p = scos.p;
				}
                if((mat[temp.x][temp.y][temp.p] > mat[scos.x][scos.y][scos.p] + 1) && (temp.p >= 0))
                {
                    mat[temp.x][temp.y][temp.p] = mat[scos.x][scos.y][scos.p] + 1;
                    Q.push_back(temp);
                }
            }
        }
    }
	printf("%d\n", mat[ex][ey][div_count-1]);
    return 0;
}