#include <bits/stdc++.h>
using namespace std;
int a[105][105];
vector<vector<int>> op = {{1, 1, 1, 2, 2, 2},
                          {1, 1, 1, 2, 2, 1},
                          {1, 1, 2, 1, 2, 2},
                          {2, 1, 1, 2, 2, 2}};
vector<vector<int>> solve22() {
  vector<vector<int>> res;
  for (int bit = 0; bit < (1 << 4); bit++) {
    bitset<4> bs = bit;
    int b[3][3];
    vector<vector<int>> tmp;
    for (int i = 1; i <= 2; i++) {
      for (int j = 1; j <= 2; j++) {
        b[i][j] = a[i][j];
      }
    }
    for (int j = 0; j < 4; j++) {
      if (bs[j]) {
        tmp.push_back(op[j]);
      }
    }
    for (auto v : tmp) {
      for (int i = 0; i < 3; i++) {
        b[v[i * 2]][v[i * 2 + 1]] ^= 1;
      }
    }
    int ok = 1;
    for (int i = 1; i <= 2; i++) {
      for (int j = 1; j <= 2; j++) {
        if (b[i][j] == 1) ok = 0;
      }
    }
    if (ok) {
      return tmp;
    }
  }
  return {};
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  int t;
  cin >> t;
  for (int z = 1; z <= t; z++) {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        char c;
        cin >> c;
        a[i][j] = c - '0';
      }
    }
    vector<vector<int>> res;
    while (n > 2) {
      for (int i = 1; i < m; i++) {
        if (a[n][i]) {
          a[n - 1][i] ^= 1;
          a[n - 1][i + 1] ^= 1;
          a[n][i] ^= 1;
          res.push_back({n - 1, i, n - 1, i + 1, n, i});
        }
      }
      if (a[n][m]) {
        a[n - 1][m] ^= 1;
        a[n - 1][m - 1] ^= 1;
        a[n][m] ^= 1;
        res.push_back({n - 1, m, n - 1, m - 1, n, m});
      }
      n--;
    }
    while (m > 2) {
      for (int i = 1; i < n; i++) {
        if (a[i][m]) {
          a[i][m - 1] ^= 1;
          a[i + 1][m - 1] ^= 1;
          a[i][m] ^= 1;
          res.push_back({i, m - 1, i + 1, m - 1, i, m});
        }
      }
      if (a[n][m]) {
        a[n][m - 1] ^= 1;
        a[n - 1][m - 1] ^= 1;
        a[n][m] ^= 1;
        res.push_back({n, m - 1, n - 1, m - 1, n, m});
      }
      m--;
    }
    auto res1 = solve22();
    for (auto v : res1) res.push_back(v);
    cout << res.size() << '\n';
    for (auto i : res) {
      for (auto j : i) {
        cout << j << " ";
      }
      cout << "\n";
    }
  }
  return 0;
}
