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

#define rep(i,a,b) for (int i=a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int R, C;
int ER, EC, TR, TC; // empty; target
const int MAXN = 255;
int g[MAXN][MAXN];

inline bool inr(int i, int j) {
    return i >= 1 && j >= 1 && i <= R && j <= C;
}

inline bool valid(int i, int j) {
    return inr(i,j) && g[i][j] != -2;
}

const int dirs[4][2] = {{0,1},{0,-1},{-1,0},{1,0}};

vector<int> ans;
void solve(int i, int j) {
    if (g[i][j] == -2) {
        cout << "impossible\n";
        exit(0);
    }
    if (g[i][j] == -1) {
        // we win
        return;
    }
    // we're at a car
    for (const auto& [di, dj] : dirs) {
        int ti = i+di;
        int tj = j+dj;
        if (!inr(ti, tj)) continue;
        if (g[ti][tj] == g[i][j]) {
            // same car
            solve(ti+di, tj+dj);
            ans.push_back(g[i][j]);
        }
    }
}


int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> R >> C;
    for (int i = 1; i <= R; ++i) {
        for (int j = 1; j <= C; ++j) {
            cin >> g[i][j];
            if (g[i][j] == -1) {
                ER = i;
                EC = j;
            }
        }
    }
    cin >> TR >> TC;
    solve(TR, TC);
    for (int i : ans) {
        cout << i << ' ';
    }
    cout << '\n';


}