#pragma region _head

#include<iostream>
#include<fstream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<iomanip>
#include<queue>
#include<stack>
#include<numeric>
#include<utility>
#include<regex>
#include<climits>

void Init() {
	std::cin.tie(0); std::ios::sync_with_stdio(false);
	struct Init_caller { Init_caller() { Init(); } }caller;
}

#pragma region _define

#define int LL
#define rep(i,n) for(LL (i)=0;(i)<(n);(i)++)
#define rep2(i,j,a,h,w) for(LL (i)=0;(i)<(h);(i)++)for(LL (j)=0;(j)<(w);(j)++)cin>>a[i][j]
#define all(a) (a).begin(),(a).end()
#define size(s) ((LL)s.size())
#define F first
#define S second
#define check() cout<<"! ! !"
#define endl "\n"
#define _y() cout<<"Yes"<<endl
#define _Y() cout<<"YES"<<endl
#define _n() cout<<"No"<<endl
#define _N() cout<<"NO"<<endl
#define INT_INF INT_MAX
#define INF LLONG_MAX
#define MOD 1000000007

#pragma endregion





#pragma region _using

using namespace std;

using LL = long long;
using st = string;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<st>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using qi = queue<int>;
using qc = queue<char>;
using qs = queue<st>;
using si = stack<int>;
using sc = stack<char>;
using ss = stack<st>;
using pi = pair<int, int>;
using ppi = pair<pi, int>;
using mii = map<int, int>;
using mib = map<int, bool>;
using mci = map<char, int>;
using msb = map<st, bool>;
using vpi = vector<pi>;
using vppi = vector<ppi>;
using qpi = queue<pi>;

#pragma endregion

//4,2,8,6,1,7,3,9
int arround_x[] = { -1,0,0,1,-1,-1,1,1 };
int arround_y[] = { 0,1,-1,0,1,-1,1,-1 };



void y_n(bool p) {
	p ? _y() : _n();
}

void Y_N(bool p) {
	p ? _Y() : _N();
}

LL vmax(vi v) {
	int n = size(v);
	int MAX = 0;
	rep(i,n){
		MAX = max(MAX, v[i]);
	}
	return MAX;
}

LL vmin(vi v) {
	int n = size(v);
	int MIN = INF;
	rep(i,n){
		MIN = min(MIN, v[i]);
	}
	return MIN;
}

LL vsum(vi v) {
	int n = size(v);
	int sum = 0;
	rep(i, n) {
		sum += v[i];
	}
	return sum;
}

LL gcd(LL a, LL b) {
	if (b == 0) {
		swap(a, b);
	}
	LL r;
	while ((r = a % b) != 0) {
		a = b;
		b = r;
	}
	return b;
}
LL lcm(LL a, LL b) {
	return (a / gcd(a, b) * b);
}

bool is_square(int n) {
	if ((int)sqrt(n)*(int)sqrt(n) == n) {
		return true;
	}
	else {
		return false;
	}
}


bool is_prime(int n) {
	if (n == 1) {
		return false;
	}
	else {
		for (int i = 2; i*i <= n; i++) {
			if (n % i == 0) {
				return false;
			}
		}
	}
	return true;
}

vi dec_num(int n, vi &v) {
	int a = 2;
	v.push_back(1);
	v.push_back(n);
	while (a*a <= n) {
		if (n%a == 0) {
			v.push_back(a);
			n /= a;
			v.push_back(n);
			
		}
		a++;
	}
	sort(all(v));
	return v;
}


vi dec_prime(int n, vi &v) {
	int a = 2;
	while (a*a <= n) {
		if (n % a == 0) {
			v.push_back(a);
			n /= a;
		}
		else {
			a++;
		}
	}
	v.push_back(n);
	return v;
}


int sieve_prime(LL a, LL b) {
	if (a > b)swap(a, b);
	vb s(b + 1, true);
	int cnt_a = 0, cnt_b = 0;
	for (int i = 2; i <= b ;i++){
		for (int j = 2; i*j <= b; j++) {
			s[i*j] = false;
		}
	}
	for (int i = 2; i <= b; i++) {
		if (s[i]) {
			//cout << i << " ";
			if (i < a) {
				cnt_a++;
			}
			cnt_b++;
		}
	}
	return cnt_b - cnt_a;
}


LL factorial(LL n) {
	LL a = 1, ret = 1;
	while (a < n) {
		a++;
		ret *= a;
		ret %= MOD;
	}
	return ret;
}


#pragma endregion 

vi par;

int root(int x) {
	if (par[x] == x) {
		return x;
	}
	else {
		return par[x] = root(par[x]);
	}
}

void unite(int x, int y) {
	if (root(x) == root(y)) {
		return;
	}
	else {
		par[root(x)] = root(y);
		return;
	}
}

bool same(int x, int y) {
	return root(x) == root(y);
}

struct edge {
	int to;
	int cost;
};

using ve = vector<edge>;
using vve = vector<ve>;

/*****************************************************************************/
signed main() {

	int h, w;
	cin >> h >> w;
	vvi a(h, vi(w));
	rep(i, h) {
		rep(j, w) {
			cin >> a[i][j];
		}
	}
	int num = 0;
	vi ans;
	rep(i, h) {
		if (i % 2 == 0) {
			rep(j, w) {
				if (i == h - 1 && j == w - 1)break;
				if (a[i][j] % 2 != 0) {
					if (j + 1 == w) {
						//cout << i + 1 << " " << j + 1 << " " << i + 1 + 1 << " " << j + 1 << endl;
						ans.push_back(i + 1); ans.push_back(j + 1); ans.push_back(i + 2); ans.push_back(j + 1);
						a[i + 1][j]++;
						a[i][j]--;
					}
					else {
						//cout << i + 1 << " " << j + 1 << " " << i + 1 << " " << j + 1 + 1 << endl;
						ans.push_back(i + 1); ans.push_back(j + 1); ans.push_back(i + 1); ans.push_back(j + 2);
						a[i][j + 1]++;
						a[i][j]--;
					}
				}
			}
		}
		else {
			for (int j = w - 1; j >= 0; j--) {
				if (i == h - 1 && j == 0)break;
				if (a[i][j] % 2 != 0) {
					if (j == 0) {
						//cout << i + 1 << " " << j + 1 << " " << i + 1 + 1 << " " << j + 1 << endl;
						ans.push_back(i + 1); ans.push_back(j + 1); ans.push_back(i + 2); ans.push_back(j + 1);
						a[i + 1][j]++;
						a[i][j]--;
					}
					else {
						//cout << i + 1 << " " << j + 1 << " " << i + 1 << " " << j + 1 - 1 << endl;
						ans.push_back(i + 1); ans.push_back(j + 1); ans.push_back(i + 1); ans.push_back(j);
						a[i][j - 1]++;
						a[i][j]--;
					}
				}
			}
		}
	}
	cout << size(ans) / 4 << endl;
	for (int i = 0; i < size(ans); i += 4) {
		cout << ans[i] << " " << ans[i + 1] << " " << ans[i + 2] << " " << ans[i + 3] << endl;
	}
	return 0;
}

Measured memory_bytes: 8304