Problem: 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.

Constraints

* All values in input are integers.
* 1 \leq H, W \leq 500
* 0 \leq a_{ij} \leq 9

Input

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}


Output

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.

Examples

Input

2 3
1 2 3
0 1 1


Output

3
2 2 2 3
1 1 1 2
1 3 1 2


Input

3 2
1 0
2 1
1 0


Output

3
1 1 1 2
1 2 2 2
3 1 3 2


Input

1 5
9 9 9 9 9


Output

2
1 1 1 2
1 3 1 4

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		Main mainObj = new Main();
		mainObj.solve();
	}
	
	int[][] map;

	public void solve() throws IOException {
		FastScanner fs = new FastScanner();
		
		
		int h = fs.nextInt();
		int w = fs.nextInt();
		
		map = new int[h][w];
		
		for(int i = 0; i < h; i++) {
			for(int j = 0; j < w; j++) {
				map[i][j] = fs.nextInt() % 2;
 			}
		}
		
		ArrayList<String> manipList = new ArrayList<>();
		
		int nowH = 0;
		
		while(nowH < h) {
			
			if(nowH % 2 == 0) {
				for(int i = 0; i < w; i++) {
					if(map[nowH][i] % 2 == 1) {
						if(i == w-1) {
							if(nowH != h-1) {
								manipList.add(makeManip(nowH, i, nowH+1, i));
							}
						}else{
							manipList.add(makeManip(nowH, i, nowH, i+1));
						}
					}
				}
			}else {
				for(int i = w - 1; i >= 0; i--) {
					if(map[nowH][i] % 2 == 1) {
						if(i == 0) {
							if(nowH != h-1) {
								manipList.add(makeManip(nowH, i, nowH+1, i));
							}
						}else{
							manipList.add(makeManip(nowH, i, nowH, i-1));
						}
					}
				}
			}
			
			nowH++;
		}
		
		System.out.println(manipList.size());
		for(String str : manipList) {
			System.out.println(str);
		}
	}
	
	String makeManip(int beforeH, int beforeW, int afterH, int afterW){
		
		map[afterH][afterW] += 1;
		
		StringBuffer sb = new StringBuffer();
		sb.append(beforeH+1).append(" ").append(beforeW+1).append(" ").append(afterH+1).append(" ").append(afterW+1);
		return sb.toString();
		
	}

	

	public class FastScanner {

		BufferedReader reader;
		private StringTokenizer st;

		public FastScanner() {
			st = null;
			reader = new BufferedReader(new InputStreamReader(System.in));
		}

		public String next() throws IOException {
			if (st == null || !st.hasMoreElements()) {
				st = new StringTokenizer(reader.readLine());
			}
			return st.nextToken();
		}

		public String nextLine() throws IOException {
			st = null;
			String readLine = null;
			readLine = reader.readLine();
			return readLine;
		}

		public int nextInt() throws NumberFormatException, IOException {
			return Integer.parseInt(next());
		}

		public long nextLong() throws NumberFormatException, IOException {
			return Long.parseLong(next());
		}

		public int[] nextIntArr(int n) throws NumberFormatException, IOException {
			int[] retArr = new int[n];
			for (int i = 0; i < n; i++) {
				retArr[i] = nextInt();
			}
			return retArr;
		}

		public long[] nextLongArr(int n) throws NumberFormatException, IOException {
			long[] retArr = new long[n];
			for (int i = 0; i < n; i++) {
				retArr[i] = nextLong();
			}
			return retArr;
		}

		public void close() throws IOException {
			reader.close();
		}
	}

}