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: #
  # 　　  ⋀_⋀　 
  #　　  (･ω･)  
  # .／ Ｕ ∽ Ｕ＼
  #  │＊　合　＊│
  #  │＊　格　＊│ 
  #  │＊　祈　＊│ 
  #  │＊　願　＊│ 
  #  │＊　　　＊│ 
  #      ￣
  #
  import sys
  sys.setrecursionlimit(10**6)
  input=sys.stdin.readline
  from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
  from heapq import heappop, heappush, heappushpop
  from collections import Counter,defaultdict,deque
  from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
  from bisect import bisect_left,bisect_right
  from copy import deepcopy
  inf=float('inf')
  mod = 10**9+7
  def pprint(*A): 
      for a in A:     print(*a,sep='\n')
  def INT_(n): return int(n)-1
  def MI(): return map(int,input().split())
  def MF(): return map(float, input().split())
  def MI_(): return map(INT_,input().split())
  def LI(): return list(MI())
  def LI_(): return [int(x) - 1 for x in input().split()]
  def LF(): return list(MF())
  def LIN(n:int): return [I() for _ in range(n)]
  def LLIN(n: int): return [LI() for _ in range(n)]
  def LLIN_(n: int): return [LI_() for _ in range(n)]
  def LLI(): return [list(map(int, l.split() )) for l in input()]
  def I(): return int(input())
  def F(): return float(input())
  def ST(): return input().replace('\n', '')
  def main():
      H,W=MI()
      A=LLIN(H)
      odds=[]
      ans=[]
      for i in range(H):
          if i&1:
              for j in range(W)[::-1]:
                  if A[i][j]&1:
                      if j==0:
                          dy=1
                          dx=0
                      else:
                          dy=0
                          dx=-1
                      if i+dy!=H:
                          
                          ans.append((i+1,j+1,i+dy+1,j+dx+1))
                          A[i+dy][j+dx]+=1
          else:
              for j in range(W)[::-1]:
                  if A[i][j]&1:
                      if j==W-1:
                          dy=1
                          dx=0
                      else:
                          dy=0
                          dx=1
                      if i+dy!=H:
                         
                          ans.append((i+1,j+1,i+dy+1,j+dx+1))
                          A[i+dy][j+dx]+=1
  
      print(len(ans))
      for a in ans:
          print(*a)
      
  
  
  if __name__ == '__main__':
  　　main()
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"}]