1
dz[6] = {-1, 1, 0, 0, 0, 0};
2
dx[6] = {0, 0, -1, 0, 1, 0};
3
dy[6] = {0, 0, 0, 1, 0, -1};

1
#include <iostream>
2
#include <queue>
3

4
#define endl '\n'
5

6
using namespace std;
7

8
struct Node {
9
  int z, x, y, t, k, v;
10
};
11

12
const int H = 165;
13
const int N = 405;
14

15
int h, n, m, v, w;
16
int a[H][N][N], sz, sx, sy;
17
queue<Node> q;
18
bool inq[H][N][N];
19
int dz[6]{-1, 1, 0, 0, 0, 0}, dx[6]{0, 0, -1, 0, 1, 0}, dy[6]{0, 0, 0, 1, 0, -1};
20

21
int bfs() {
22
  int k = a[sz][sx][sy] == 5 ? 1 : 0;
23
  q.push({sz, sx, sy, 0, k, v});
24
  inq[sz][sx][sy] = true;
25
  Node p;
26

27
  while (q.size()) {
28
    p = q.front();
29
    q.pop();
30

31
    for (int i = 0; i < 6; ++i) {
32
      int nz = p.z + dz[i];
33
      int nx = p.x + dx[i];
34
      int ny = p.y + dy[i];
35
      int nt = p.t + 1;
36
      int nk = p.k;
37
      int nv = p.v;
38

39
      if (nz < 1 || nz > h) continue;
40
      if (nx < 1 || nx > n || ny < 1 || ny > m) {
41
        return nt;
42
      }
43
      if (inq[nz][nx][ny]) continue;
44
      if (a[nz][nx][ny] == 2) continue;
45
      if (a[nz][nx][ny] == 3) {
46
        if (nv >= w) {
47
          nv -= w;
48
        } else {
49
          continue;
50
        }
51
      } else if (a[nz][nx][ny] == 4) {
52
        if (nk) {
53
          --nk;
54
        } else {
55
          continue;
56
        }
57
      } else if (a[nz][nx][ny] == 5) {
58
        ++nk;
59
      }
60

61
      q.push({nz, nx, ny, nt, nk, nv});
62
      inq[nz][nx][ny] = true;
63
    }
64
  }
65

66
  return 0;
67
}
68

69
int main() {
70
  ios::sync_with_stdio(false);
71
  cin.tie(nullptr), cout.tie(nullptr);
72

73
  cin >> h >> n >> m;
74
  cin >> sz >> sx >> sy;
75
  cin >> v >> w;
76
  for (int k = 1; k <= h; ++k) {
77
    for (int i = 1; i <= n; ++i) {
78
      for (int j = 1; j <= m; ++j) {
79
        cin >> a[k][i][j];
80
      }
81
    }
82
  }
83

84
  int ans = bfs();
85
  if (!ans) {
86
    cout << "No";
87
  } else {
88
    cout << "Yes" << endl;
89
    cout << ans;
90
  }
91
}