#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
mt19937_64 mt_rand(chrono::system_clock::now().time_since_epoch().count());
template <typename T1, typename T2>
inline bool upmax(T1& a, T2 b) {
  return (a < b ? (a = b, true) : false);
}
template <typename T1, typename T2>
inline bool upmin(T1& a, T2 b) {
  return (b < a ? (a = b, true) : false);
}
const int maxn = (int)300 + 20;
const int maxlog = 21;
const int base = (int)1e9 + 7;
const long double eps = (long double)1e-7;
const long double PI = acos(-1.);
const int pp = 41;
int n, m;
string a[maxn][maxn];
string b[maxn][maxn];
deque<int> aq[maxn][maxn];
vector<tuple<int, int, int, int>> ans;
void ppush(int x1, int y1, int x2, int y2) {
  if (x1 == x2 && y1 == y2) {
    return;
  }
  ans.emplace_back(x1, y1, x2, y2);
  aq[x2][y2].push_front(aq[x1][y1].back());
  aq[x1][y1].pop_back();
}
void print() {
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (aq[i][j].empty()) cout << '-';
      for (int c : aq[i][j]) {
        cout << c;
      }
      cout << " ";
    }
    cout << "\n";
  }
  exit(0);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int s = 0;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cin >> a[i][j];
      s += a[i][j].size();
      for (char c : a[i][j]) {
        aq[i][j].push_back(c == '1');
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cin >> b[i][j];
      reverse((b[i][j]).begin(), (b[i][j]).end());
    }
  }
  for (int i = 2; i <= n; i++) {
    while (!aq[i][1].empty()) {
      ppush(i, 1, 1, 1);
    }
  }
  for (int i = 2; i <= m; i++) {
    while (!aq[1][i].empty()) {
      ppush(1, i, 1, 1);
    }
  }
  for (int i = 2; i <= n; i++) {
    for (int j = 2; j <= m; j++) {
      while (!aq[i][j].empty()) {
        int x = aq[i][j].back();
        if (x) {
          ppush(i, j, 1, j);
          ppush(1, j, 1, 2);
        } else {
          ppush(i, j, i, 1);
          ppush(i, 1, 2, 1);
        }
      }
    }
  }
  while (!aq[1][1].empty()) {
    int c = aq[1][1].back();
    if (c) {
      ppush(1, 1, 1, 2);
    } else {
      ppush(1, 1, 2, 1);
    }
  }
  for (int i = 2; i <= n; i++) {
    for (int j = 2; j <= m; j++) {
      for (char c : b[i][j]) {
        if (c == '0') {
          ppush(2, 1, i, 1);
          ppush(i, 1, i, j);
        } else {
          ppush(1, 2, 1, j);
          ppush(1, j, i, j);
        }
      }
    }
  }
  for (int i = 3; i <= n; i++) {
    int j = 1;
    for (char c : b[i][j]) {
      if (c == '0') {
        ppush(2, 1, i, 1);
        ppush(i, 1, i, j);
      } else {
        ppush(1, 2, 1, j);
        ppush(1, j, i, j);
      }
    }
  }
  for (int j = 3; j <= m; j++) {
    int i = 1;
    for (char c : b[i][j]) {
      if (c == '0') {
        ppush(2, 1, i, 1);
        ppush(i, 1, i, j);
      } else {
        ppush(1, 2, 1, j);
        ppush(1, j, i, j);
      }
    }
  }
  for (char c : b[1][2]) {
    if (c == '0') {
      ppush(2, 1, 1, 1);
      ppush(1, 1, 1, 2);
    } else {
      ppush(1, 2, 1, 1);
      ppush(1, 1, 1, 2);
    }
  }
  for (char c : b[2][1]) {
    if (c == '0') {
      ppush(2, 1, 1, 1);
      ppush(1, 1, 2, 1);
    } else {
      ppush(1, 2, 1, 1);
      ppush(1, 1, 2, 1);
    }
  }
  for (char c : b[1][1]) {
    if (c == '0') {
      ppush(2, 1, 1, 1);
    } else {
      ppush(1, 2, 1, 1);
    }
  }
  assert(s * 4 >= ans.size());
  cerr << s << "\n";
  cout << ans.size() << '\n';
  for (auto& t : ans) {
    int a, b, c, d;
    tie(a, b, c, d) = t;
    cout << a << " " << b << " " << c << " " << d << '\n';
  }
  return 0;
}
