#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
template <class C>
void mini(C &a4, C b4) {
  a4 = min(a4, b4);
}
template <class C>
void maxi(C &a4, C b4) {
  a4 = max(a4, b4);
}
template <class TH>
void _dbg(const char *sdbg, TH h) {
  cerr << sdbg << '=' << h << endl;
}
template <class TH, class... TA>
void _dbg(const char *sdbg, TH h, TA... a) {
  while (*sdbg != ',') cerr << *sdbg++;
  cerr << '=' << h << ',';
  _dbg(sdbg + 1, a...);
}
template <class T>
ostream &operator<<(ostream &os, vector<T> V) {
  os << "[";
  for (auto vv : V) os << vv << ",";
  return os << "]";
}
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
struct Sol {
  long long n, m;
  vector<string> t;
  vector<vector<pair<long long, long long>>> res;
  void rusz(vector<pair<long long, long long>> pom) {
    res.push_back(pom);
    for (pair<long long, long long> el : pom) {
      t[el.first][el.second] ^= 1;
    }
  }
  void run() {
    cin >> n >> m;
    t.resize(n);
    for (long long i = (0); i <= ((long long)(n)-1); i++) {
      cin >> t[i];
      for (long long j = (0); j <= ((long long)(m)-1); j++) t[i][j] -= '0';
    }
    for (long long i = (0); i <= ((long long)(n - 2) - 1); i++) {
      for (long long j = (0); j <= ((long long)(m - 2) - 1); j++) {
        if (t[i][j] == 1) {
          rusz({{i, j}, {i + 1, j}, {i, j + 1}});
        }
      }
    }
    for (long long i = (0); i <= ((long long)(n - 2) - 1); i++) {
      vector<pair<long long, long long>> pom;
      if (t[i][m - 1]) {
        pom.push_back({i, m - 1});
      }
      if (t[i][m - 2]) {
        pom.push_back({i, m - 2});
      }
      if (((long long)(pom).size())) {
        for (long long j = (0); j <= ((long long)(2) - 1); j++) {
          if (((long long)(pom).size()) != 3) {
            pom.push_back({i + 1, m - j - 1});
          }
        }
        rusz(pom);
      }
    }
    for (long long i = (0); i <= ((long long)(m - 2) - 1); i++) {
      vector<pair<long long, long long>> pom;
      if (t[n - 1][i]) {
        pom.push_back({n - 1, i});
      }
      if (t[n - 2][i]) {
        pom.push_back({n - 2, i});
      }
      if (((long long)(pom).size())) {
        for (long long j = (0); j <= ((long long)(2) - 1); j++) {
          if (((long long)(pom).size()) != 3) {
            pom.push_back({n - j - 1, i + 1});
          }
        }
        rusz(pom);
      }
    }
    while (1) {
      vector<pair<long long, long long>> zle;
      vector<pair<long long, long long>> dobre;
      for (long long i = (0); i <= ((long long)(2) - 1); i++)
        for (long long j = (0); j <= ((long long)(2) - 1); j++) {
          if (t[n - i - 1][m - j - 1]) {
            zle.push_back({n - i - 1, m - j - 1});
          } else {
            dobre.push_back({n - i - 1, m - j - 1});
          }
        }
      if (((long long)(zle).size()) == 0) break;
      if (((long long)(zle).size()) == 2) {
        dobre.push_back(zle[0]);
        rusz(dobre);
      } else if (((long long)(zle).size()) == 1) {
        zle.push_back(dobre[0]);
        zle.push_back(dobre[1]);
        rusz(zle);
      } else {
        zle.resize(3);
        rusz(zle);
      }
    }
    cout << ((long long)(res).size()) << "\n";
    for (long long i = (0); i <= ((long long)(((long long)(res).size())) - 1);
         i++) {
      for (pair<long long, long long> el : res[i]) {
        cout << el.first + 1 << " " << el.second + 1 << " ";
      }
      cout << "\n";
    }
  }
};
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(11);
  if (0) cout << fixed << setprecision(6);
  long long t;
  cin >> t;
  while (t--) {
    Sol sol;
    sol.run();
  }
}
