import java.io.PrintWriter
import java.util.Scanner

import scala.annotation.tailrec

object Main {
  def main(args: Array[String]): Unit = {
    //nextLineとnextを同時に使ったら死ぬ
    val sc = new Scanner(System.in)

    val h, w = sc.nextInt()
    val arr = Array.fill(h, w)(sc.nextInt())
    val pw = new PrintWriter(System.out)

    var count = 0
    var isGoingRight = 1
    for (i <- 0 until h) {
      for (j <- 0 until w) {
        val jj = w - j - 1
        if (arr(i)(jj) % 2 != 0) {
          if (arr(i).lift(jj + isGoingRight).isDefined) {
            arr(i)(jj) -= 1
            arr(i)(jj + isGoingRight) += 1
            count += 1
            pw.println(s"${i + 1} ${jj + 1} ${i + 1} ${jj + isGoingRight + 1}")
          } else if (arr.lift(i + 1).flatMap(_.lift(jj)).isDefined) {
            arr(i)(jj) -= 1
            arr(i + 1)(jj) += 1
            count += 1
            pw.println(s"${i + 1} ${jj + 1} ${i + 2} ${jj + 1}")
          }
        }
      }
      isGoingRight = -isGoingRight
    }
    println(count)
    pw.flush()

  }

  //region

  def debug(args: Any*): Unit = {
    Console.err.println(args.mkString(" "))
    Console.err.flush()
  }

  def printExecTime(process: => Unit): Unit = {
    val start = System.currentTimeMillis
    process
    debug("処理時間： " + (System.currentTimeMillis - start) + " ミリ秒")
  }

  def bitSearch[T](n: Int, choice: Vector[T]): Vector[Vector[T]] = {
    @tailrec
    def bitSearchLogic(n: Int,
                       choice: Vector[T],
                       acc: Vector[Vector[T]]): Vector[Vector[T]] = {
      if (n == 0) acc
      else {
        val newAcc =
          acc.flatMap(vec => {
            choice.map(c => vec :+ c)
          })
        bitSearchLogic(n - 1, choice, newAcc)
      }
    }

    val firstAcc = choice.map(i => Vector(i))
    bitSearchLogic(n - 1, choice, firstAcc)
  }
  //endregion
}
