#include <bits/stdc++.h>

using namespace std;

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

const int kN = 50;
const int kSize = 1e6;
const int di[] = {-1, 0, 1, 0}, dj[] = {0, 1, 0, -1};
short n, m, a[1 + kN][1 + kN];
unordered_set<short> vis[1 + kN][1 + kN];

struct state {
  short i, j, rest;
  int dist;
} q[kSize];

bool inside(const short &i, const short &j) {
  return 1 <= i && i <= n && 1 <= j && j <= m;
}

void TestCase() {
  short k, x1, y1, x2, y2;
  fin >> n >> m >> k >> x1 >> y1 >> x2 >> y2;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      int x;
      fin >> x;
      a[i][j] = x % k;
    }
  }
  int st = 0, dr = -1;
  vis[x1][y1].emplace(a[x1][y1]);
  q[++dr] = {x1, y1, a[x1][y1], 1};
  while (st <= dr) {
    state curr = q[st++];
    for (short dir = 0; dir < 4; ++dir) {
      short iv = curr.i + di[dir], jv = curr.j + dj[dir];
      if (inside(iv, jv)) {
        int new_rest = (int)curr.rest * a[iv][jv];
        if (k <= new_rest) {
          new_rest %= k;
        }
        if (iv == x2 && jv == y2 && new_rest == 0) {
          fout << curr.dist + 1 << '\n';
          return;
        }
        if (!vis[iv][jv].count(new_rest)) {
          vis[iv][jv].emplace(new_rest);
          q[++dr] = {iv, jv, new_rest, curr.dist + 1};
        }
      }
    }
  }
}

int main() {
  int tests = 1;
  for (int tc = 1; tc <= tests; ++tc) {
    TestCase();
  }
  fin.close();
  fout.close();
  return 0;
}