#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
#define mod long(998244353)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(10)
#define highest(x) (63 - __builtin_clzl(x))

int main(){
    int H, W;
    cin >> H >> W;
    int a_mod_2[H][W];
    int a_mod_2_sum = 0;
    for(int i = 0; i < H; i++){
        for(int j = 0; j < W; j++){
            int a;
            cin >> a;
            a_mod_2[i][j] = a % 2;
            a_mod_2_sum += a % 2;
        }
    }
    int a_mod_2_pair_remaining = a_mod_2_sum / 2;
    int back = false;
    vector<pair<pair<int, int>, pair<int, int>>> ans;
    for(int i = 0; i < H; i++){
        if(i % 2){
            for(int j = W - 1; j >= 0; j--){
                if(a_mod_2[i][j]){
                    back ^= 1;
                    a_mod_2_pair_remaining -= !back;
                }
                if(a_mod_2_pair_remaining == 0){
                    break;
                }
                if(back){
                    if(j == 0){
                        ans.push_back({{i, j}, {i + 1, j}});
                    }else{
                        ans.push_back({{i, j}, {i, j - 1}});
                    }
                }
            }
        }else{
            for(int j = 0; j < W; j++){
                if(a_mod_2[i][j]){
                    back ^= 1;
                    a_mod_2_pair_remaining -= !back;
                }
                if(a_mod_2_pair_remaining == 0){
                    break;
                }
                if(back){
                    if(j == W - 1){
                        ans.push_back({{i, j}, {i + 1, j}});
                    }else{
                        ans.push_back({{i, j}, {i, j + 1}});
                    }
                }
            }
        }
    }
    cout << ans.size() << endl;
    for(int i = 0; i < ans.size(); i++){
        cout << ans[i].first.first + 1 << " ";
        cout << ans[i].first.second + 1 << " ";
        cout << ans[i].second.first + 1 << " ";
        cout << ans[i].second.second + 1 << endl;
    }
}


Measured memory_bytes: 5104