#include <bits/stdc++.h>
using namespace std;

# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s)  std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
# define yes(j) std::cout << (j ? "yes" : "no") << endl;
# define all(v) v.begin(),v.end()
# define showVector(v) REP(i,v.size()){p(v[i]);p(" ")} pl("")
template<class T> inline bool chmin(T &a, T b){ if(a > b) { a = b; return true;} return false;}
template<class T> inline bool chmax(T &a, T b){ if(a < b) { a = b; return true;} return false;}
typedef long long int ll;
typedef pair<int,int> P_ii;
typedef pair<double,double> P_dd;

template<class T>
vector<T> make_vec(size_t a){
    return vector<T>(a);
}

template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
  return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}

template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
  for(auto &e:t) fill_v(e,v);
}


const int MOD = 1000000007;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;

void addM(long long &a, long long b) {
    a += b;
    if (a >= MOD) a -= MOD;
}

void mulM(long long &a, long long b) {
    a = ((a%MOD)*(b%MOD))%MOD ;
}

// a^b mod M
long myPow(long a,long b,int M) {
    long ret = 1;
    long tmp = a;
    while(b>0) {
        if((b&1)==1) ret = (ret * tmp) % M;
        tmp = (tmp * tmp) % M;
        b = b>>1;
    }
    return ret;
}

 // nCk mod M
int nCk(int n,int k,int M) {
    long ret = 1;
    int mi = min(k, n-k);
    for(int i=1;i<=mi;i++) {
        ret = (ret * myPow(i,M-2,M)) % M;
    }
    for(int i=n-mi+1;i<=n;i++) {
        ret = (ret * i) % M;
    }
    return (int)ret;
};

int main() {
    int H,W;
    cin >> H >> W;

    auto g = make_vec<int>(H,W);

    REP(i,H) REP(j,W) cin >> g[i][j];

    vector<P_ii> from;
    vector<P_ii> to;

    int k = 0;
    REP(i,H) {
        if(i%2==0){
            for(int j = 0 ; j < W ; j++,k++){
                if(k == H*W-1) break;
                if(g[i][j]%2==1){
                    g[i][j] -= 1;
                    from.push_back({i+1,j+1});
                    if(j+1==W) {
                        to.push_back({i+2,j+1});
                        g[i+1][j] += 1;
                    } else {
                        to.push_back({i+1,j+2});
                        g[i][j+1] += 1;
                    }
                }
            }
        } else {
            for(int j = W - 1 ; j >= 0 ; j--,k++){
                if(k == H*W-1) break;
                if(g[i][j]%2==1){
                    g[i][j] -= 1;
                    from.push_back({i+1,j+1});
                    if(j+1==1) {
                        to.push_back({i+2,j+1});
                        g[i+1][j] += 1;
                    } else {
                        to.push_back({i+1,j});
                        g[i][j-1] += 1;
                    }
                }
            }
        }
    }

    pl(from.size())
    REP(i,from.size()) printf("%d %d %d %d\n",from[i].first,from[i].second,to[i].first,to[i].second);

    return 0;
}

Measured memory_bytes: 5228