import java.util.*;
import java.lang.*;

public class Main {
    static int[] dx = {0, 1, 0, -1};
    static int[] dy = {1, 0, -1, 0};

    static int sx, sy, gx, gy;
    static int row, col;

    static final int maxn = 1005;
    static int[][] dis = new int[maxn][maxn];
    static int[][] board;

    static class node {
        int x;
        int y;

        public node(int x, int y) {
            this.x = x;
            this.y = y;
        }
    }

    static node prev[][];

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (sc.hasNext()) {
            row = sc.nextInt(); col = sc.nextInt();
            board = new int[row][col];
            prev = new node[row][col];

            for (int i = 0; i < row; i++) {
                for (int j = 0; j < col; j++) {
                    board[i][j] = sc.nextInt();
                }
            }

            sx = sy = 0;
            gx = row - 1;
            gy = col - 1;
            bfs();
            // System.out.printf("%d%n", dis[gx][gy]);
        }
    }

    public static void bfs() {
        Queue<int[]> que = new LinkedList<>();
        Deque<int[]> res = new LinkedList<>();

        // 初始化
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < col; j++) {
                dis[i][j] = -1;
            }
        }

        que.offer(new int[]{sx, sy});
        dis[sx][sy] = 0;

        while (!que.isEmpty()) {
            int[] pos = que.poll();
            int x = pos[0], y = pos[1];

            for (int k = 0; k < 4; k++) {
                int xx = x + dx[k];
                int yy = y + dy[k];

                if (isValid(xx, yy)) {
                    dis[xx][yy] = dis[x][y] + 1;
                    prev[xx][yy] = new node(x, y);
                    que.offer(new int[]{xx, yy});
                }
            }
        }

        int tmpx = gx, tmpy = gy;

        while (true) {
            res.push(new int[]{tmpx, tmpy});
            int curx = prev[tmpx][tmpy].x;
            int cury = prev[tmpx][tmpy].y;
            tmpx = curx;
            tmpy = cury;
            if (tmpx == sx && tmpy == sy) break;
        }
        res.push(new int[]{tmpx, tmpy});

        while (!res.isEmpty()) {
            int[] pos = res.pop();
            System.out.printf("(%d,%d)%n", pos[0], pos[1]);
        }
    }

    public static boolean isValid(int x, int y) {
        if (x < 0 || x >= row || y < 0 || y >= col || board[x][y] == 1 || dis[x][y] != -1) return false;
        return true;
    }
}