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: #!/usr/bin/env python
  # coding: utf-8
  #
  
  import copy
  
  
  def advance(h, w, nx, ny):
      if 0 == ny % 2:
          if nx == w - 1:
              return nx, ny + 1
          else:
              return nx + 1, ny
      elif 1 == ny % 2:
          if nx == 0:
              return nx, ny + 1
          else:
              return nx - 1, ny
  
  
  def main(h, x, mat):
      nx = 0
      ny = 0
      retlist = []
      while nx < w and ny < h:
          """終了条件"""
          next_x, next_y = advance(h, w, nx, ny)
          if next_x == w or next_y == h:
              break
          if 0 == mat[ny][nx] % 2:
              pass
          else:
              mat[ny][nx] -= 1
              mat[next_y][next_x] += 1
              retlist.append([ny, nx, next_y, next_x])
              # print('{} {} {} {}'.format(ny, nx, next_y, next_x))
          nx = next_x
          ny = next_y
  
      print(len(retlist))
      for i in range(len(retlist)):
          print(
              "{} {} {} {}".format(
                  retlist[i][0] + 1,
                  retlist[i][1] + 1,
                  retlist[i][2] + 1,
                  retlist[i][3] + 1,
              )
          )
  
  
  if __name__ == "__main__":
      try:
          h, w = list(map(int, input().strip().split(" ")))
          mat = []
          for i in range(h):
              mat.append(list(map(int, input().strip().split(" "))))
          main(h, w, mat)
      except EOFError:
          pass
  
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"}]