#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e2 + 10;
const int MAXM = 4e6 + 10;
const long long MOD = 998244353;
const long long INF = 0x3f3f3f3f;
const unsigned long long BASE = 233;
const int base = 5;
mt19937_64 mt(time(0));
char rubbish[110];
bool GETDATA;
bool PRINT;
inline long long read() {
  long long x = 0, f = 1;
  char ch;
  do {
    ch = getchar();
    if (ch == '-') f = -1;
  } while (ch < '0' || ch > '9');
  do {
    x = x * 10 + ch - 48;
    ch = getchar();
  } while (ch >= '0' && ch <= '9');
  return x * f;
}
inline void write(long long x, char con = '\n') {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) write(x / 10, 0);
  putchar(x % 10 + '0');
  if (con) putchar(con);
}
long long N, M, K, Q;
char a[MAXN][MAXN];
vector<pair<pair<int, int>, int> > res;
int dir[4][2] = {{0, 0}, {0, 1}, {1, 0}, {1, 1}};
vector<int> act[16];
void mark(int x) {
  int b[2][2];
  int c[2][2];
  int cnt;
  int mini = INF;
  int res = 0;
  bool able;
  for (int i = 0; i < 4; i++) {
    b[dir[i][0]][dir[i][1]] = (bool)(x & (1 << i));
  }
  for (int k = 0; k < 16; k++) {
    for (int i = 0; i < 2; i++) {
      for (int j = 0; j < 2; j++) {
        c[i][j] = 0;
      }
    }
    cnt = 0;
    for (int i = 0; i < 4; i++) {
      if (k & (1 << i)) {
        cnt++;
        for (int j = 0; j < 4; j++) {
          if (i != j) {
            c[dir[j][0]][dir[j][1]] ^= 1;
          }
        }
      }
    }
    able = true;
    for (int i = 0; i < 2; i++) {
      for (int j = 0; j < 2; j++) {
        if (c[i][j] != b[i][j]) {
          able = false;
        }
      }
    }
    if (able && cnt < mini) {
      mini = cnt;
      res = k;
    }
  }
  for (int i = 0; i < 4; i++) {
    if (res & (1 << i)) {
      act[x].push_back(i);
    }
  }
}
void init() {
  res.clear();
  for (int i = 1; i <= N; i++) {
    for (int j = 1; j <= M; j++) {
      a[i][j] -= '0';
    }
  }
  for (int i = 0; i < 16; i++) {
    act[i].clear();
    mark(i);
  }
}
void calc(int x, int y, int i) {
  for (int j = 0; j < 4; j++) {
    if (i != j) {
      a[x + dir[j][0]][y + dir[j][1]] ^= 1;
    }
  }
}
void check(int x, int y) {
  int k = 0;
  for (int i = 0; i < 4; i++) {
    if (a[x + dir[i][0]][y + dir[i][1]]) {
      k |= (1 << i);
    }
  }
  for (auto step : act[k]) {
    calc(x, y, step);
    res.push_back(pair<pair<int, int>, int>(pair<int, int>(x, y), step));
  }
}
void solve() {
  long long ans = 0;
  int now;
  N = read();
  M = read();
  for (int i = 1; i <= N; i++) {
    scanf("%s", a[i] + 1);
  }
  init();
  for (long long i = 1; i <= N - 2; i++) {
    for (long long j = 1; j <= M - 2; j++) {
      if (a[i][j]) {
        if (a[i][j + 1] && a[i + 1][j]) {
          now = 3;
        } else if (a[i][j + 1]) {
          now = 2;
        } else {
          now = 1;
        }
        res.push_back(pair<pair<int, int>, int>(pair<int, int>(i, j), now));
        calc(i, j, now);
      }
    }
  }
  for (long long i = N - 1, j = 1; j <= M - 2; j += 2) {
    if (j == M - 2) {
      if (a[i][j] && a[i + 1][j]) {
        now = 3;
      } else if (a[i][j]) {
        now = 2;
      } else if (a[i + 1][j]) {
        now = 0;
      } else {
        continue;
      }
      res.push_back(pair<pair<int, int>, int>(pair<int, int>(i, j), now));
      calc(i, j, now);
    } else {
      check(i, j);
    }
  }
  for (long long i = 1, j = M - 1; i <= N - 2; i += 2) {
    if (i == N - 2) {
      if (a[i][j] && a[i][j + 1]) {
        now = 3;
      } else if (a[i][j]) {
        now = 1;
      } else if (a[i][j + 1]) {
        now = 0;
      } else {
        continue;
      }
      res.push_back(pair<pair<int, int>, int>(pair<int, int>(i, j), now));
      calc(i, j, now);
    } else {
      check(i, j);
    }
  }
  check(N - 1, M - 1);
  write(res.size());
  for (int i = 0; i < res.size(); i++) {
    ans = 0;
    for (int j = 0; j < 4; j++) {
      if (res[i].second != j) {
        ans++;
        write((res[i].first.first + dir[j][0]), ' ');
        write(res[i].first.second + dir[j][1], ans == 3 ? '\n' : ' ');
      }
    }
  }
}
int main() {
  int T;
  T = 1;
  T = read();
  GETDATA = false;
  for (int t = 1; t <= T; t++) {
    PRINT = false;
    solve();
  }
  return 0;
}
