#include <bits/stdc++.h>
using namespace std;

#define INF 2000000000

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;

int main() {
  int m, n;
  cin >> m >> n;
  vvi grid(m, vi(n));
  int start;
  int target;
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < n; j++) {
      cin >> grid[i][j];
      if (grid[i][j] == -1)
        start = n * i + j;
    }
  }
  int x, y;
  cin >> x >> y;
  x--;
  y--;
  target = n * x + y;
  vector<vector<ii>> adj(m * n);
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < n; j++) {
      // up
      if (grid[i][j] != -2 && i >= 2 && grid[i - 1][j] == grid[i - 2][j] &&
          grid[i - 1][j] != -2) {
        adj[i * n + j].push_back({(i - 2) * n + j, 1});
      }
      // down
      if (grid[i][j] != -2 && i + 2 < m && grid[i + 1][j] == grid[i + 2][j] &&
          grid[i + 1][j] != -2) {
        adj[i * n + j].push_back({(i + 2) * n + j, 1});
      }
      // right
      if (grid[i][j] != -2 && j + 2 < n && grid[i][j + 1] == grid[i][j + 2] &&
          grid[i][j + 1] != -2) {
        adj[i * n + j].push_back({i * n + j + 2, 1});
      }
      if (grid[i][j] != -2 && j >= 2 && grid[i][j - 1] == grid[i][j - 2] &&
          grid[i][j - 1] != -2) {
        adj[i * n + j].push_back({i * n + j - 2, 1});
      }
    }
  }
  vector<int> d(m * n, INF);
  vector<int> parent(m * n, -1);
  d[start] = 0;
  deque<int> q;
  q.push_front(start);
  while (!q.empty()) {
    int v = q.front();
    q.pop_front();
    for (auto edge : adj[v]) {
      int u = edge.first;
      int w = edge.second;
      if (d[v] + w < d[u]) {
        d[u] = d[v] + w;
        parent[u] = v;
        if (w == 1)
          q.push_back(u);
        else
          q.push_front(u);
      }
    }
  }
  if (d[target] == INF) {
    cout << "impossible";
  } else {
    vector<int> path = {target};
    while (parent[*path.rbegin()] != start) {
      path.push_back(parent[*path.rbegin()]);
    }
    reverse(path.begin(), path.end());
    for (int node : path) {
      cout << grid[node / n][node % n] << " ";
    }
    cout << "\n";
  }
}