#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
void err(istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {}
namespace fastIO {
bool IOerror = 0;
inline char nc() {
  static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000;
  if (p1 == pend) {
    p1 = buf;
    pend = buf + fread(buf, 1, 100000, stdin);
    if (pend == p1) {
      IOerror = 1;
      return -1;
    }
  }
  return *p1++;
}
inline bool blank(char ch) {
  return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
inline void read(int &x) {
  char ch;
  while (blank(ch = nc()))
    ;
  if (IOerror) return;
  for (x = ch - '0'; (ch = nc()) >= '0' && ch <= '9'; x = x * 10 + ch - '0')
    ;
}
}  // namespace fastIO
using namespace fastIO;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 200 + 7;
char a[maxn][maxn];
struct Node {
  int a, b, c, d, e, f;
  Node(int _a, int _b, int _c, int _d, int _e, int _f)
      : a(_a), b(_b), c(_c), d(_d), e(_e), f(_f) {}
};
vector<Node> ans;
void moddd(int A, int b, int c, int d, int e, int f) {
  ans.emplace_back(A, b, c, d, e, f);
  a[A][b] ^= 1;
  a[c][d] ^= 1;
  a[e][f] ^= 1;
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n, m;
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) scanf("%s", &a[i][1]);
    for (int i = 1; i <= n - 2; ++i)
      for (int j = 1; j <= m; ++j) {
        if (a[i][j] == '0') continue;
        if (j == m) {
          moddd(i, j, i + 1, j - 1, i + 1, j);
        } else if (a[i][j + 1] == '1') {
          moddd(i, j, i, j + 1, i + 1, j);
        } else
          moddd(i, j, i + 1, j, i + 1, j + 1);
      }
    for (int j = 1; j <= m - 1; ++j) {
      if (a[n - 1][j] == '1') {
        if (a[n][j] == '1')
          moddd(n - 1, j, n, j, n - 1, j + 1);
        else
          moddd(n - 1, j, n - 1, j + 1, n, j + 1);
      } else if (a[n][j] == '1')
        moddd(n, j, n - 1, j + 1, n, j + 1);
    }
    if (a[n - 1][m] == '1' && a[n][m] == '1') {
      moddd(n - 1, m, n - 1, m - 1, n, m - 1);
      moddd(n, m, n - 1, m - 1, n, m - 1);
    } else if (a[n - 1][m] == '1') {
      moddd(n - 1, m, n - 1, m - 1, n, m - 1);
      moddd(n - 1, m - 1, n - 1, m, n, m);
      moddd(n, m - 1, n - 1, m, n, m);
    } else if (a[n][m] == '1') {
      moddd(n, m, n - 1, m - 1, n, m - 1);
      moddd(n - 1, m - 1, n - 1, m, n, m);
      moddd(n, m - 1, n - 1, m, n, m);
    }
    cout << ans.size() << endl;
    for (auto v : ans) {
      cout << v.a << ' ' << v.b << ' ' << v.c << ' ' << v.d << ' ' << v.e << ' '
           << v.f << ' ' << endl;
    }
    ans.clear();
  }
}
