#include<iostream>
#include<vector>
using namespace std;

void findPath(vector<vector<int>>& maze, vector<vector<int>>& best, vector<vector<int>>& temp, int row, int col, int N, int M) {

    maze[row][col] = 1;
    temp.push_back({ row,col });
    if (row == N - 1 && col == M - 1) {
        if (best.empty() || best.size() > temp.size()) {
            best = temp;
        }
    }
    //
    if (row - 1 >= 0 && maze[row - 1][col] == 0) {
        findPath(maze, best, temp, row - 1, col, N, M);
    }
    //
    if (row + 1 < N && maze[row + 1][col] == 0) {
        findPath(maze, best, temp, row + 1, col, N, M);
    }
    //
    if (col - 1 >= 0 && maze[row][col - 1] == 0) {
        findPath(maze, best, temp, row, col - 1, N, M);
    }
    //
    if (col + 1 < M && maze[row][col + 1] == 0) {
        findPath(maze, best, temp, row, col + 1, N, M);
    }
    maze[row][col] = 0;
    temp.pop_back();
}
int main() {
    int N, M;
    while (cin >> N >> M) {
        vector<vector<int>> maze(N, vector<int>(M, 0));
        vector<vector<int>> best;
        vector<vector<int>> temp;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < M; j++) {
                cin >> maze[i][j];
            }
        }
        findPath(maze, best, temp, 0, 0, N, M);
        for (int i = 0; i < best.size(); i++) {
            cout << "(" << best[i][0] << "," << best[i][1] << ")" << endl;
        }
    }
    return 0;
}