#include <iostream> 
#include <vector> 
using namespace std; 
 
class Solution { 
public: 
  bool hasPath(char* matrix, int rows, int cols, int startX,int startY, int endX, int endY,vector<int>& Path) 
  { 
    if (matrix == NULL || rows < 1 || cols < 1 || startX<0||startY<0||endX<0||endY<0||(startX==endX&&startY==endY)) 
      return false; 
    bool* visited = new bool[rows*cols];       //定義一個(gè)輔助矩陣，用來(lái)標(biāo)記路徑是否已經(jīng)進(jìn)入了每個(gè)格子 
    memset(visited, 0, rows*cols); 
    int pathLength = 0; 
    if (hasPathCore(matrix, rows, cols, startX, startY, endX, endY, visited, Path)) 
    { 
      return true; 
    } 
    delete[] visited; 
    return false; 
  } 
 
  /*此函數(shù)用來(lái)判斷在當(dāng)前路徑滿足條件下，相鄰格子中是否存在一個(gè)格子滿足條件*/ 
  bool hasPathCore(char* matrix, int rows, int cols, int row, int col, int endX, int endY, bool* visited, vector<int>& Path) 
  { 
    if ((row == endX) && (col == endY)&&(matrix[row*cols+col]=='1')) 
    { 
      Path.push_back(endY); 
      Path.push_back(endX); 
      return true; 
    } 
    bool hasPath = false; 
    if (row >= 0 && row < rows&&col >= 0 && col < cols&&matrix[row*cols + col] == '1' && !visited[row*cols + col]) 
    { 
//     ++pathLength; 
      visited[row*cols + col] = true; 
      Path.push_back(col); 
      Path.push_back(row); 
      /*如果矩陣格子(row,col)字符為1時(shí)，從它的4個(gè)相鄰格子中尋找下一個(gè)字符為1的格子*/ 
      hasPath = hasPathCore(matrix, rows, cols, row, col - 1, endX, endY, visited,Path) || 
        hasPathCore(matrix, rows, cols, row - 1, col, endX, endY, visited,Path) || 
        hasPathCore(matrix, rows, cols, row, col + 1, endX, endY, visited,Path) || 
        hasPathCore(matrix, rows, cols, row + 1, col, endX, endY, visited,Path); 
      if (!hasPath)               //如果沒(méi)找到，則說(shuō)明當(dāng)前第n個(gè)格子定位不正確，返回上一個(gè)位置重新定位 
      { 
        visited[row*cols + col] = false; 
        Path.pop_back(); 
        Path.pop_back(); 
      } 
    } 
    return hasPath; 
  } 
}; 
 
int main() 
{ 
  // char* matrix = "abcesfcsadee"; 
  char* matrix = "1000000110110001101000010111011110100000010000001";    //設(shè)置迷宮 
  int startX, startY, endX, endY; 
  cin >> startX >> startY >> endX >> endY;                  //輸入起始結(jié)束坐標(biāo) 
  Solution s; 
  vector<int> Path; 
  bool re = s.hasPath(matrix, 7, 7, startX,startY,endX,endY,Path); 
  cout << re << endl; 
  for (int i = 0; i < Path.size();) 
    cout << "(" << Path[i++] << ',' << Path[i++] << ")" << " "; 
  cout << endl; 
  return 0; 
}