output_description: Print a sequence of operations that maximizes the number of cells containing
  an even number of coins, in the following format:
  
      
      
      N
      y_1 x_1 y_1' x_1'
      y_2 x_2 y_2' x_2'
      :
      y_N x_N y_N' x_N'
      
  
  That is, in the first line, print an integer N between 0 and H \times W
  (inclusive), representing the number of operations.
  
  In the (i+1)-th line (1 \leq i \leq N), print four integers y_i, x_i, y_i' and
  x_i' (1 \leq y_i, y_i' \leq H and 1 \leq x_i, x_i' \leq W), representing the
  i-th operation. These four integers represents the operation of moving one of
  the coins placed in Cell (y_i, x_i) to a vertically or horizontally adjacent
  cell, (y_i', x_i').
  
  Note that if the specified operation violates the specification in the problem
  statement or the output format is invalid, it will result in _Wrong Answer_.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      H W
      a_{11} a_{12} ... a_{1W}
      a_{21} a_{22} ... a_{2W}
      :
      a_{H1} a_{H2} ... a_{HW}
attempt: h, w = map(int, input().split(" "))
  
  
  def judge(t):
      if int(t) % 2 == 1:
          return "d"
      else:
          return int(t)
  
  
  field = [["n" for i in range(w + 1)]]
  for i in range(1, h + 1):
      field.append(list(map(judge, input().split(" "))))
      field[i] = ["n"] + field[i]
  d_num = 0
  for i in range(1, h + 1):
      for j in range(1, w + 1):
          if field[i][j] == "d":
              d_num += 1
  
  ans_a = []
  ans_a2 = []
  pri = False
  for i in range(1, h + 1):
      if i % 2 == 1:
          dir_j = [i + 1 for i in range(w)]
      else:
          dir_j = [w - i for i in range(w)]
      for j in dir_j:
          if field[i][j] == "d" and d_num >= 2:
              if pri:
                  pri = False
                  ans_a.append([i, j])
                  for k in range(len(ans_a) - 1):
                      ans_a2.append(ans_a[k] + ans_a[k + 1])
                  ans_a = []
              else:
                  pri = True
          if pri:
              ans_a.append([i, j])
  
  print(len(ans_a2))
  for i in ans_a2:
      print(" ".join(list(map(str, i))))
  
problem_description: Statement
  
  There is a grid of square cells with H horizontal rows and W vertical columns.
  The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
  
  In Cell (i, j), a_{ij} coins are placed.
  
  You can perform the following operation any number of times:
  
  Operation: Choose a cell that was not chosen before and contains one or more
  coins, then move one of those coins to a vertically or horizontally adjacent
  cell.
  
  Maximize the number of cells containing an even number of coins.
samples: [{"input": "2 3\n    1 2 3\n    0 1 1", "output": "3\n    2 2 2 3\n    1 1 1 2\n    1 3 1 2\n    \n\nEvery cell contains an even number of coins after the following sequence of\noperations:\n\n  * Move the coin in Cell (2, 2) to Cell (2, 3).\n  * Move the coin in Cell (1, 1) to Cell (1, 2).\n  * Move one of the coins in Cell (1, 3) to Cell (1, 2).\n\n* * *"}, {"input": "3 2\n    1 0\n    2 1\n    1 0", "output": "3\n    1 1 1 2\n    1 2 2 2\n    3 1 3 2\n    \n\n* * *"}, {"input": "1 5\n    9 9 9 9 9", "output": "2\n    1 1 1 2\n    1 3 1 4"}]