#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) { cout << (expr ? "Yes" : "No") << "\n"; }
template <class T>
void chmax(T &a, const T &b) {
  if (a < b) a = b;
}
template <class T>
void chmin(T &a, const T &b) {
  if (b < a) a = b;
}
void flip(int i, int j, vector<string> &s) {
  s[i][j] = (s[i][j] == '1') ? '0' : '1';
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int T;
  cin >> T;
  while (T--) {
    int n, m;
    cin >> n >> m;
    vector<string> s(n);
    for (int i = (0), i_end_ = (n); i < i_end_; i++) cin >> s[i];
    vector<vector<int>> ans(n * m, vector<int>(6));
    int ptr = 0;
    for (int i = (0), i_end_ = (n - 2); i < i_end_; i++)
      for (int j = (0), j_end_ = (m); j < j_end_; j++) {
        if (s[i][j] == '1') {
          if (j != m - 1) {
            ans[ptr] = {i + 1, j + 1, i + 2, j + 1, i + 2, j + 2};
            flip(i, j, s);
            flip(i + 1, j, s);
            flip(i + 1, j + 1, s);
          } else {
            ans[ptr] = {i + 1, j + 1, i + 2, j + 1, i + 2, j};
            flip(i, j, s);
            flip(i + 1, j, s);
            flip(i + 1, j - 1, s);
          }
          ptr++;
        }
      }
    for (int j = (0), j_end_ = (m - 2); j < j_end_; j++) {
      if (s[n - 2][j] == '1' && s[n - 1][j] == '1') {
        ans[ptr] = {n - 1, j + 1, n, j + 1, n - 1, j + 2};
        flip(n - 2, j, s);
        flip(n - 1, j, s);
        flip(n - 2, j + 1, s);
        ptr++;
      } else if (s[n - 2][j] == '1' && s[n - 1][j] == '0') {
        ans[ptr] = {n - 1, j + 1, n - 1, j + 2, n, j + 2};
        flip(n - 2, j, s);
        flip(n - 2, j + 1, s);
        flip(n - 1, j + 1, s);
        ptr++;
      } else if (s[n - 2][j] == '0' && s[n - 1][j] == '1') {
        ans[ptr] = {n, j + 1, n - 1, j + 2, n, j + 2};
        flip(n - 1, j, s);
        flip(n - 2, j + 1, s);
        flip(n - 1, j + 1, s);
        ptr++;
      }
    }
    int cnt = 0;
    for (int i = (n - 2), i_end_ = (n); i < i_end_; i++)
      for (int j = (m - 2), j_end_ = (m); j < j_end_; j++)
        if (s[i][j] == '1') cnt++;
    if (cnt == 4) {
      ans[ptr] = {n - 1, m, n, m - 1, n, m};
      flip(n - 2, m - 1, s);
      flip(n - 1, m - 2, s);
      flip(n - 1, m - 1, s);
      cnt = 1;
      ptr++;
    }
    if (cnt == 1) {
      if (s[n - 2][m - 2] == '1') {
        ans[ptr] = {n - 1, m - 1, n, m - 1, n, m};
        flip(n - 2, m - 2, s);
        flip(n - 1, m - 2, s);
        flip(n - 1, m - 1, s);
        cnt = 2;
        ptr++;
      } else {
        ans[ptr] = {n - 1, m, n, m - 1, n, m};
        flip(n - 2, m - 1, s);
        flip(n - 1, m - 2, s);
        flip(n - 1, m - 1, s);
        cnt = 2;
        ptr++;
      }
    }
    if (cnt == 2) {
      if (s[n - 2][m - 2] == '0' && s[n - 1][m - 1] == '1') {
        ans[ptr] = {n - 1, m - 1, n, m - 1, n - 1, m};
        flip(n - 2, m - 2, s);
        flip(n - 1, m - 2, s);
        flip(n - 2, m - 1, s);
        ptr++;
      } else if (s[n - 2][m - 2] == '0' && s[n - 1][m - 1] == '0') {
        ans[ptr] = {n - 1, m - 1, n, m - 1, n, m};
        flip(n - 2, m - 2, s);
        flip(n - 1, m - 2, s);
        flip(n - 1, m - 1, s);
        ptr++;
      } else {
        ans[ptr] = {n - 1, m, n, m - 1, n, m};
        flip(n - 2, m - 1, s);
        flip(n - 1, m - 2, s);
        flip(n - 1, m - 1, s);
        ptr++;
      }
      cnt = 3;
    }
    if (cnt == 3) {
      if (s[n - 2][m - 2] == '0') {
        ans[ptr] = {n - 1, m, n, m - 1, n, m};
        flip(n - 2, m - 1, s);
        flip(n - 1, m - 2, s);
        flip(n - 1, m - 1, s);
      } else if (s[n - 2][m - 1] == '0') {
        ans[ptr] = {n - 1, m - 1, n, m - 1, n, m};
        flip(n - 2, m - 2, s);
        flip(n - 1, m - 2, s);
        flip(n - 1, m - 1, s);
      } else if (s[n - 1][m - 2] == '0') {
        ans[ptr] = {n - 1, m - 1, n - 1, m, n, m};
        flip(n - 2, m - 2, s);
        flip(n - 2, m - 1, s);
        flip(n - 1, m - 1, s);
      } else {
        ans[ptr] = {n - 1, m - 1, n, m - 1, n - 1, m};
        flip(n - 2, m - 2, s);
        flip(n - 1, m - 2, s);
        flip(n - 2, m - 1, s);
      }
    }
    cnt = 0;
    for (int i = (0), i_end_ = (n * m); i < i_end_; i++) {
      if (ans[i][0] == 0) break;
      cnt++;
    }
    cout << cnt << "\n";
    for (int i = (0), i_end_ = (cnt); i < i_end_; i++) {
      for (int j = (0), j_end_ = (6); j < j_end_; j++)
        cout << ans[i][j] << (j != 6 - 1 ? " " : "");
      cout << "\n";
    }
  }
}
