#include <bits/stdc++.h>

using namespace std;

ifstream fin("kdrum.in");
ofstream fout("kdrum.out");

int n, m, k, startx, starty, stopx, stopy, dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, matrix[52][52], dp[52][52][2002];
queue <pair <int, pair <int, int> > > coada;

bool Valid(int i, int j)
{
    return i >= 1 && j >= 1 && i <= n && j <= m;
}

int main()
{
    fin >> n >> m >> k >> startx >> starty >> stopx >> stopy;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            fin >> matrix[i][j];
            matrix[i][j] %= k;
            for (int t = 0; t <= k; ++t)
                dp[i][j][t] = (1 << 30);
        }
    }
    int idk = matrix[startx][stopx] % k;
    coada.push({idk, {startx, starty}});
    dp[startx][starty][idk] = 1;
    while (!coada.empty())
    {
        int i = coada.front().second.first;
        int j = coada.front().second.second;
        int val = coada.front().first;
        coada.pop();
        for (int w = 0; w < 4; ++w)
        {
            int ii = i + dx[w];
            int jj = j + dy[w];
            if (Valid(ii, jj) && 1 + dp[i][j][val] < dp[ii][jj][(1LL * val * matrix[ii][jj]) % k])
            {
                dp[ii][jj][(val * matrix[ii][jj]) % k] = 1 + dp[i][j][val];
                coada.push({(1LL * val * matrix[ii][jj]) % k, {ii, jj}});
            }
        }
    }
    fout << dp[stopx][stopy][0];
    fin.close();
    fout.close();
    return 0;
}