#include <bits/stdc++.h>
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
const int maxn = 2e2 + 7;
const int INF = 0x3f3f3f3f;
const long long INFF = 1e18;
char s[maxn][maxn];
int t, n, m;
struct node {
  int x, y;
};
vector<node> ans;
void change(int x, int y) {
  if (s[x][y] == '0')
    s[x][y] = '1';
  else
    s[x][y] = '0';
}
void solve(int x, int y) {
  int num = 0;
  vector<node> v0, v1;
  s[x][y] == '0' ? v0.push_back(node{x, y}) : v1.push_back(node{x, y});
  s[x + 1][y] == '0' ? v0.push_back(node{x + 1, y})
                     : v1.push_back(node{x + 1, y});
  s[x][y + 1] == '0' ? v0.push_back(node{x, y + 1})
                     : v1.push_back(node{x, y + 1});
  s[x + 1][y + 1] == '0' ? v0.push_back(node{x + 1, y + 1})
                         : v1.push_back(node{x + 1, y + 1});
  if (v1.size() == 1) {
    ans.push_back(v0[0]);
    ans.push_back(v0[2]);
    ans.push_back(v1[0]);
    ans.push_back(v0[1]);
    ans.push_back(v0[2]);
    ans.push_back(v1[0]);
    ans.push_back(v0[0]);
    ans.push_back(v0[1]);
    ans.push_back(v1[0]);
  } else if (v1.size() == 2) {
    ans.push_back(v0[0]);
    ans.push_back(v0[1]);
    ans.push_back(v1[1]);
    ans.push_back(v0[0]);
    ans.push_back(v0[1]);
    ans.push_back(v1[0]);
  } else if (v1.size() == 3) {
    ans.push_back(v1[0]);
    ans.push_back(v1[1]);
    ans.push_back(v1[2]);
  } else if (v1.size() == 4) {
    ans.push_back(v1[0]);
    ans.push_back(v1[1]);
    ans.push_back(v1[2]);
    ans.push_back(v1[1]);
    ans.push_back(v1[2]);
    ans.push_back(v1[3]);
    ans.push_back(v1[0]);
    ans.push_back(v1[2]);
    ans.push_back(v1[3]);
    ans.push_back(v1[0]);
    ans.push_back(v1[1]);
    ans.push_back(v1[3]);
  }
}
int main() {
  scanf("%d", &t);
  while (t--) {
    ans.clear();
    scanf("%d%d", &n, &m);
    for (int i = 0; i <= n - 1; i++) scanf("%s", s[i]);
    for (int i = 0; i <= n - 3; i++) {
      for (int j = 0; j <= m - 1; j++) {
        if (s[i][j] == '0') continue;
        if (j != m - 1) {
          ans.push_back(node{i, j});
          change(i, j);
          ans.push_back(node{i + 1, j});
          change(i + 1, j);
          ans.push_back(node{i + 1, j + 1});
          change(i + 1, j + 1);
        } else {
          ans.push_back(node{i, j});
          change(i, j);
          ans.push_back(node{i + 1, j});
          change(i + 1, j);
          ans.push_back(node{i + 1, j - 1});
          change(i + 1, j - 1);
        }
      }
    }
    for (int j = 0; j <= m - 3; j++) {
      for (int i = n - 2; i <= n - 1; i++) {
        if (s[i][j] == '1') {
          ans.push_back(node{i, j});
          change(i, j);
          ans.push_back(node{i, j + 1});
          change(i, j + 1);
          if (i == n - 2) {
            ans.push_back(node{i + 1, j + 1});
            change(i + 1, j + 1);
          }
          if (i == n - 1) {
            ans.push_back(node{i - 1, j + 1});
            change(i - 1, j + 1);
          }
        }
      }
    }
    solve(n - 2, m - 2);
    printf("%d\n", ans.size() / 3);
    for (int i = 0; i < ans.size(); i++) {
      if (i % 3 == 0 && i) puts("");
      printf("%d %d ", ans[i].x + 1, ans[i].y + 1);
    }
    puts("");
  }
  return 0;
}
