#include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX / 4, SINF = 0x3f;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
const int maxn = 1e6 + 1e5;
int mo_num = 1e9 + 7;
int n, m, t, a[maxn], b[maxn], ans, case_of_T;
int f[102][102];
vector<vector<pair<int, int>>> Ans;
vector<pair<int, int>> h;
vector<pair<int, int>> ling, yi;
void deal4(int i, int j) {
  ling.clear(), yi.clear(), h.clear();
  if (f[i][j])
    yi.push_back({i, j});
  else
    ling.push_back({i, j});
  if (f[i + 1][j])
    yi.push_back({i + 1, j});
  else
    ling.push_back({i + 1, j});
  if (f[i][j + 1])
    yi.push_back({i, j + 1});
  else
    ling.push_back({i, j + 1});
  if (f[i + 1][j + 1])
    yi.push_back({i + 1, j + 1});
  else
    ling.push_back({i + 1, j + 1});
  int num = f[i][j] + f[i + 1][j] + f[i][j + 1] + f[i + 1][j + 1];
  if (num == 4) {
    h.push_back({i, j});
    f[i][j] = f[i][j] ^ 1;
    h.push_back({i, j + 1});
    f[i][j + 1] = f[i][j + 1] ^ 1;
    h.push_back({i + 1, j + 1});
    f[i + 1][j + 1] = f[i + 1][j + 1] ^ 1;
    Ans.push_back(h);
    deal4(i, j);
  } else if (num == 2 or num == 1) {
    for (int o = 0; o <= 1; o++) {
      h.push_back({ling[o].first, ling[o].second});
      f[ling[o].first][ling[o].second] ^= 1;
    }
    for (int o = 0; o <= 0; o++) {
      h.push_back({yi[o].first, yi[o].second});
      f[yi[o].first][yi[o].second] ^= 1;
    }
    Ans.push_back(h);
    deal4(i, j);
  } else if (num == 3) {
    for (int o = 0; o <= 2; o++) {
      h.push_back({yi[o].first, yi[o].second});
      f[yi[o].first][yi[o].second] ^= 1;
    }
    Ans.push_back(h);
    deal4(i, j);
  }
}
void solve() {
  cin >> n >> m;
  Ans.clear();
  for (int i = 1; i <= n; i++) {
    string k;
    cin >> k;
    for (int j = 1; j <= m; j++) f[i][j] = k[j - 1] - '0';
  }
  for (int i = 1; i <= n - 2; i++) {
    for (int j = 1; j <= m - 1; j++) {
      if (f[i][j]) {
        h.clear();
        h.push_back({i, j});
        f[i][j] ^= 1;
        h.push_back({i + 1, j});
        f[i + 1][j] ^= 1;
        h.push_back({i + 1, j + 1});
        f[i + 1][j + 1] ^= 1;
        Ans.push_back(h);
      }
    }
    if (f[i][m]) {
      h.clear();
      h.push_back({i, m});
      f[i][m] ^= 1;
      h.push_back({i + 1, m});
      f[i + 1][m] ^= 1;
      h.push_back({i + 1, m - 1});
      f[i + 1][m - 1] ^= 1;
      Ans.push_back(h);
    }
  }
  for (int j = 1; j <= m - 2; j++) {
    if (!f[n - 1][j] && !f[n][j]) continue;
    h.clear();
    int have = 3;
    if (f[n - 1][j]) {
      h.push_back({n - 1, j});
      f[n - 1][j] ^= 1;
      have--;
    }
    if (f[n][j]) {
      h.push_back({n, j});
      f[n][j] ^= 1;
      have--;
    }
    if (have) {
      h.push_back({n - 1, j + 1});
      f[n - 1][j + 1] ^= 1;
      have--;
    }
    if (have) {
      h.push_back({n, j + 1});
      f[n][j + 1] ^= 1;
    }
    Ans.push_back(h);
  }
  deal4(n - 1, m - 1);
  cout << (Ans.size()) << '\n';
  for (auto i : Ans) {
    for (auto j : i) cout << j.first << " " << j.second << " ";
    cout << '\n';
  }
  return;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  cin >> T;
  while (T--) solve();
  return 0;
}
