#include <bits/stdc++.h>
using namespace std;
void getre() {
  int x = 0;
  printf("%d\n", 1 / x);
}
void gettle() {
  int res = 1;
  while (1) res <<= 1;
  printf("%d\n", res);
}
template <typename T, typename S>
inline bool upmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S>
inline bool upmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename N, typename PN>
inline N flo(N a, PN b) {
  return a >= 0 ? a / b : -((-a - 1) / b) - 1;
}
template <typename N, typename PN>
inline N cei(N a, PN b) {
  return a > 0 ? (a - 1) / b + 1 : -(-a / b);
}
template <typename N>
N gcd(N a, N b) {
  return b ? gcd(b, a % b) : a;
}
template <typename N>
inline int sgn(N a) {
  return a > 0 ? 1 : (a < 0 ? -1 : 0);
}
inline void gn(long long &x) {
  int sg = 1;
  char c;
  while (((c = getchar()) < '0' || c > '9') && c != '-')
    ;
  c == '-' ? (sg = -1, x = 0) : (x = c - '0');
  while ((c = getchar()) >= '0' && c <= '9') x = x * 10 + c - '0';
  x *= sg;
}
inline void gn(int &x) {
  long long t;
  gn(t);
  x = t;
}
inline void gn(unsigned long long &x) {
  long long t;
  gn(t);
  x = t;
}
inline void gn(double &x) {
  double t;
  scanf("%lf", &t);
  x = t;
}
inline void gn(long double &x) {
  double t;
  scanf("%lf", &t);
  x = t;
}
inline void gs(char *s) { scanf("%s", s); }
inline void gc(char &c) {
  while ((c = getchar()) > 126 || c < 33)
    ;
}
inline void pc(char c) { putchar(c); }
inline long long sqr(long long a) { return a * a; }
inline double sqrf(double a) { return a * a; }
const int inf = 0x3f3f3f3f;
const double pi = 3.14159265358979323846264338327950288L;
const double eps = 1e-6;
int n, m;
vector<int> b1[333][333];
vector<int> b2[333][333];
int need[333][333][2];
vector<pair<pair<int, int>, pair<int, int> > > ans1, ans2;
inline void add(int x1, int y1z, int x2, int y2,
                vector<pair<pair<int, int>, pair<int, int> > > &ans) {
  ans.push_back(make_pair(make_pair(x1, y1z), make_pair(x2, y2)));
}
int tot0 = 0, tot1 = 0;
void gao(vector<int> tar[333][333],
         vector<pair<pair<int, int>, pair<int, int> > > &ans) {
  for (int k = (((int)(tar[1][1]).size())) - 1, _ed = (0); k >= _ed; k--) {
    if (tar[1][1][k] == 0) {
      add(1, 1, 2, 1, ans);
      add(2, 1, 1, 1, ans);
    } else {
      add(1, m, 1, 1, ans);
    }
  }
  for (int k = (((int)(tar[1][m]).size())) - 1, _ed = (0); k >= _ed; k--) {
    if (tar[1][m][k] == 1) {
      add(1, m, 2, m, ans);
      add(2, m, 1, m, ans);
    } else {
      add(1, 1, 1, m, ans);
    }
  }
  for (int i = (1), _ed = (n + 1); i < _ed; i++)
    for (int j = (2), _ed = (m); j < _ed; j++) {
      for (int k = ((int)(tar[i][j]).size()) - 1; k >= 0; k--) {
        if (tar[i][j][k] == 0) {
          if (i != 1) add(1, 1, i, 1, ans);
          add(i, 1, i, j, ans);
        } else {
          if (i != 1) add(1, m, i, m, ans);
          add(i, m, i, j, ans);
        }
      }
    }
  for (int i = (2), _ed = (n + 1); i < _ed; i++) {
    int b0 = 0, a1 = 0;
    for (int k = (0), _ed = (((int)(tar[i][1]).size())); k < _ed; k++)
      if (tar[i][1][k] == 1) a1++;
    for (int k = (0), _ed = (((int)(tar[i][m]).size())); k < _ed; k++)
      if (tar[i][m][k] == 0) b0++;
    for (int k = (0), _ed = (b0); k < _ed; k++) add(1, 1, i, 1, ans);
    for (int k = (0), _ed = (a1); k < _ed; k++) add(1, m, i, m, ans);
    for (int k = (((int)(tar[i][1]).size())) - 1, _ed = (0); k >= _ed; k--) {
      if (tar[i][1][k] == 1) {
        add(i, m, i, 1, ans);
      } else
        add(1, 1, i, 1, ans);
    }
    for (int k = (((int)(tar[i][m]).size())) - 1, _ed = (0); k >= _ed; k--) {
      if (tar[i][m][k] == 1) {
        add(1, m, i, m, ans);
      } else
        add(i, 1, i, m, ans);
    }
  }
}
char s[111111];
int main() {
  gn(n);
  gn(m);
  for (int i = (1), _ed = (n + 1); i < _ed; i++)
    for (int j = (1), _ed = (m + 1); j < _ed; j++) {
      gs(s);
      for (int k = 0; s[k]; k++) {
        b1[i][j].push_back(s[k] - '0');
        if (s[k] == '0')
          tot0++;
        else
          tot1++;
      }
      reverse((b1[i][j]).begin(), (b1[i][j]).end());
    }
  for (int i = (1), _ed = (n + 1); i < _ed; i++)
    for (int j = (1), _ed = (m + 1); j < _ed; j++) {
      gs(s);
      for (int k = 0; s[k]; k++) {
        b2[i][j].push_back(s[k] - '0');
      }
    }
  gao(b1, ans1);
  gao(b2, ans2);
  printf("%d\n", ((int)(ans1).size()) + ((int)(ans2).size()));
  for (int i = (((int)(ans1).size())) - 1, _ed = (0); i >= _ed; i--) {
    auto f = ans1[i];
    printf("%d %d %d %d\n", f.second.first, f.second.second, f.first.first,
           f.first.second);
  }
  for (int i = (0), _ed = (((int)(ans2).size())); i < _ed; i++) {
    auto f = ans2[i];
    printf("%d %d %d %d\n", f.first.first, f.first.second, f.second.first,
           f.second.second);
  }
  return 0;
}
