#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int)1e9 + 23111992;
const long long LINF = (long long)1e18 + 23111992;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline unsigned long long isqrt(unsigned long long k) {
  unsigned long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int myrand() { return abs((int)mt()); }
const int maxn = 300 + 5;
int n, m;
string a[maxn][maxn];
string b[maxn][maxn];
vector<pair<pair<int, int>, pair<int, int> > > ff() {
  static queue<char> c[maxn][maxn];
  for (int i = (0); i < (n); ++i) {
    for (int j = (0); j < (m); ++j) {
      while (int((c[i][j]).size())) c[i][j].pop();
      string t = a[i][j];
      reverse((t).begin(), (t).end());
      for (char e : t) {
        c[i][j].push(e);
      }
    }
  }
  vector<pair<pair<int, int>, pair<int, int> > > moves;
  int p = int((c[0][0]).size());
  int q = int((c[0][m - 1]).size());
  for (int i = (0); i < (p); ++i) {
    char e = c[0][0].front();
    c[0][0].pop();
    if (e == '0') {
      c[n - 1][0].push(e);
      moves.push_back(make_pair(make_pair(0, 0), make_pair(n - 1, 0)));
    } else {
      c[0][m - 1].push(e);
      moves.push_back(make_pair(make_pair(0, 0), make_pair(0, m - 1)));
    }
  }
  for (int i = (0); i < (q); ++i) {
    char e = c[0][m - 1].front();
    c[0][m - 1].pop();
    if (e == '1') {
      c[n - 1][m - 1].push(e);
      moves.push_back(make_pair(make_pair(0, m - 1), make_pair(n - 1, m - 1)));
    } else {
      c[0][0].push(e);
      moves.push_back(make_pair(make_pair(0, m - 1), make_pair(0, 0)));
    }
  }
  for (int i = (1); i < (n); ++i) {
    int p = int((c[i][0]).size());
    int q = int((c[i][m - 1]).size());
    for (int j = (0); j < (p); ++j) {
      char e = c[i][0].front();
      c[i][0].pop();
      if (e == '0') {
        c[0][0].push(e);
        moves.push_back(make_pair(make_pair(i, 0), make_pair(0, 0)));
      } else {
        c[i][m - 1].push(e);
        moves.push_back(make_pair(make_pair(i, 0), make_pair(i, m - 1)));
      }
    }
    for (int j = (0); j < (q); ++j) {
      char e = c[i][m - 1].front();
      c[i][m - 1].pop();
      if (e == '1') {
        c[0][m - 1].push(e);
        moves.push_back(make_pair(make_pair(i, m - 1), make_pair(0, m - 1)));
      } else {
        c[i][0].push(e);
        moves.push_back(make_pair(make_pair(i, m - 1), make_pair(i, 0)));
      }
    }
  }
  for (int i = (0); i < (n); ++i)
    for (int j = (0); j < (m); ++j) {
      if (make_pair(i, j) != make_pair(0, 0) &&
          make_pair(i, j) != make_pair(0, m - 1)) {
        while (int((c[i][j]).size())) {
          char e = c[i][j].front();
          c[i][j].pop();
          if (e == '0') {
            if (!i || !j) {
              moves.push_back(make_pair(make_pair(i, j), make_pair(0, 0)));
            } else {
              moves.push_back(make_pair(make_pair(i, j), make_pair(i, 0)));
              moves.push_back(make_pair(make_pair(i, 0), make_pair(0, 0)));
            }
          } else {
            if (!i || j == m - 1) {
              moves.push_back(make_pair(make_pair(i, j), make_pair(0, m - 1)));
            } else {
              moves.push_back(make_pair(make_pair(i, j), make_pair(i, m - 1)));
              moves.push_back(
                  make_pair(make_pair(i, m - 1), make_pair(0, m - 1)));
            }
          }
        }
      }
    }
  return moves;
}
void chemthan() {
  deque<int> dq;
  cin >> n >> m;
  for (int i = (0); i < (n); ++i)
    for (int j = (0); j < (m); ++j) cin >> a[i][j];
  vector<pair<pair<int, int>, pair<int, int> > > res = ff();
  for (int i = (0); i < (n); ++i)
    for (int j = (0); j < (m); ++j)
      cin >> a[i][j], reverse((a[i][j]).begin(), (a[i][j]).end());
  vector<pair<pair<int, int>, pair<int, int> > > res2 = ff();
  cout << int((res).size()) + int((res2).size()) << "\n";
  for (auto it : res) {
    cout << it.first.first + 1 << " " << it.first.second + 1 << " "
         << it.second.first + 1 << " " << it.second.second + 1 << "\n";
  }
  reverse((res2).begin(), (res2).end());
  for (auto it : res2) {
    cout << it.second.first + 1 << " " << it.second.second + 1 << " "
         << it.first.first + 1 << " " << it.first.second + 1 << "\n";
  }
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
