#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const double EPS = 1e-7;
const int INF = 1e9 + 1;
template <typename A, typename B>
istream &operator>>(istream &in, pair<A, B> &p) {
  in >> p.first >> p.second;
  return in;
}
template <typename A, typename B>
ostream &operator<<(ostream &out, pair<A, B> &p) {
  out << p.first << " " << p.second;
  return out;
}
template <typename I>
istream &operator>>(istream &in, vector<I> &a) {
  for (auto &i : (a)) in >> i;
  return in;
}
template <typename I>
ostream &operator<<(ostream &out, vector<I> &a) {
  for (int i = 0; i < ((int)(a).size()); ++i) {
    if (i) out << " ";
    out << a[i];
  }
  return out;
}
void fast_io() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin.exceptions(cin.failbit);
}
deque<int> dq[301][301];
void read_dq(int n, int m, vector<vector<int>> &ones,
             vector<vector<int>> &zeros, int rev) {
  for (int i = 0; i < (n); ++i) {
    for (int j = 0; j < (m); ++j) {
      string s;
      cin >> s;
      for (auto &c : (s)) {
        if (c == '0') {
          if (rev)
            dq[i][j].push_front(0);
          else
            dq[i][j].push_back(0);
          zeros[i][j]++;
        } else {
          if (rev)
            dq[i][j].push_front(1);
          else
            dq[i][j].push_back(1);
          ones[i][j]++;
        }
      }
    }
  }
}
void add(vector<pair<pair<int, int>, pair<int, int>>> &ops, int i, int j, int k,
         int l) {
  dq[k][l].push_front(dq[i][j].back());
  dq[i][j].pop_back();
  ops.push_back(
      make_pair((make_pair((i + 1), (j + 1))), (make_pair((k + 1), (l + 1)))));
}
vector<pair<pair<int, int>, pair<int, int>>> solve(int n, int m,
                                                   vector<vector<int>> &ones,
                                                   vector<vector<int>> &zeros) {
  vector<pair<pair<int, int>, pair<int, int>>> ops;
  for (int i = 0; i < (n); ++i) {
    for (int j = 0; j < (m); ++j) {
      while (!dq[i][j].empty() &&
             !(j == 0 && ones[i][j] == 0 || j == m - 1 && zeros[i][j] == 0)) {
        if (dq[i][j].back()) {
          int k = (j == m - 1 ? (i == n - 1 ? n - 2 : n - 1) : i);
          add(ops, i, j, k, m - 1);
          ones[i][j]--;
          ones[k][m - 1]++;
        } else {
          int k = (j == 0 ? (i == 0 ? 1 : 0) : i);
          add(ops, i, j, k, 0);
          zeros[i][j]--;
          zeros[k][0]++;
        }
      }
    }
  }
  for (int i = 1; i < (n); ++i) {
    while (!dq[i][0].empty()) add(ops, i, 0, 0, 0);
    ones[i][0] = zeros[i][0] = 0;
  }
  for (int i = 0; i < (n - 1); ++i) {
    while (!dq[i][m - 1].empty()) add(ops, i, m - 1, n - 1, m - 1);
    ones[i][m - 1] = zeros[i][m - 1] = 0;
  }
  return ops;
}
void solve_test() {
  int n, m;
  cin >> n >> m;
  vector<vector<int>> ones(n, vector<int>(m, 0));
  vector<vector<int>> zeros(n, vector<int>(m, 0));
  read_dq(n, m, ones, zeros, 0);
  vector<pair<pair<int, int>, pair<int, int>>> fops = solve(n, m, ones, zeros);
  for (auto &v : (ones))
    for (auto &i : (v)) i = 0;
  for (auto &v : (zeros))
    for (auto &i : (v)) i = 0;
  for (int i = 0; i < (n); ++i)
    for (int j = 0; j < (m); ++j) dq[i][j].clear();
  read_dq(n, m, ones, zeros, 1);
  vector<pair<pair<int, int>, pair<int, int>>> sops = solve(n, m, ones, zeros);
  reverse(sops.begin(), sops.end());
  cout << (int)(fops).size() + (int)(sops).size() << endl;
  for (auto &c : (fops)) cout << c.first << " " << c.second << "\n";
  for (auto &c : (sops)) cout << c.second << " " << c.first << "\n";
}
void setup() {}
int main() {
  setup();
  srand(time(0));
  fast_io();
  int t = 1;
  while (t--) {
    solve_test();
  }
}
