#include <bits/stdc++.h>
using namespace std;
void kehsihba() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void solve() {
  long long n, m;
  cin >> n >> m;
  string s[n];
  for (long long i = 0; i < n; i++) {
    cin >> s[i];
  }
  long long a[n + 1][m + 1];
  memset(a, 0, sizeof(a));
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      if (s[i][j] == '1') {
        a[i + 1][j + 1] = 1;
      }
    }
  }
  vector<vector<long long>> v;
  for (long long j = m; j > 2; j--) {
    for (long long i = 1; i < n; i++) {
      if (a[i][j] == 0 and a[i + 1][j] == 0) {
        continue;
      }
      if (a[i][j] == 1 and a[i + 1][j] == 1) {
        a[i][j] = a[i + 1][j] = 0;
        a[i][j - 1] = 1 - a[i][j - 1];
        v.push_back({i, j, i + 1, j, i, j - 1});
        continue;
      }
      if (a[i][j] == 1) {
        a[i][j] = 0;
        a[i][j - 1] = 1 - a[i][j - 1];
        a[i + 1][j - 1] = 1 - a[i + 1][j - 1];
        v.push_back({i, j, i, j - 1, i + 1, j - 1});
        continue;
      }
      if (a[i + 1][j] == 1) {
        a[i + 1][j] = 0;
        a[i][j - 1] = 1 - a[i][j - 1];
        a[i + 1][j - 1] = 1 - a[i + 1][j - 1];
        v.push_back({i + 1, j, i, j - 1, i + 1, j - 1});
        continue;
      }
    }
  }
  for (long long i = 1; i < n; i++) {
    if (a[i][1] == 0 and a[i][2] == 0) {
      continue;
    }
    if (a[i][1] == 1 and a[i][2] == 1) {
      a[i][1] = a[i][2] = 0;
      a[i + 1][1] = 1 - a[i + 1][1];
      v.push_back({i, 1, i, 2, i + 1, 1});
    }
    if (a[i][1] == 1) {
      a[i][1] = 0;
      a[i + 1][1] = 1 - a[i + 1][1];
      a[i + 1][2] = 1 - a[i + 1][2];
      v.push_back({i, 1, i + 1, 1, i + 1, 2});
      continue;
    }
    if (a[i][2] == 1) {
      a[i][2] = 0;
      a[i + 1][1] = 1 - a[i + 1][1];
      a[i + 1][2] = 1 - a[i + 1][2];
      v.push_back({i, 2, i + 1, 1, i + 1, 2});
      continue;
    }
  }
  long long se = a[n][2] + a[n][1];
  if (se) {
    if (se == 2) {
      a[n][2] = a[n][1] = a[n - 1][1] = a[n - 1][2] = 0;
      v.push_back({n - 1, 1, n - 1, 2, n, 2});
      v.push_back({n, 1, n - 1, 1, n - 1, 2});
    } else {
      if (a[n][1] == 1) {
        a[n][1] = 0;
        v.push_back({n - 1, 1, n - 1, 2, n, 1});
        v.push_back({n, 1, n, 2, n - 1, 1});
        v.push_back({n, 1, n, 2, n - 1, 2});
      } else {
        a[n][2] = 0;
        v.push_back({n - 1, 1, n - 1, 2, n, 2});
        v.push_back({n, 1, n, 2, n - 1, 1});
        v.push_back({n, 1, n, 2, n - 1, 2});
      }
    }
  }
  cout << (long long)v.size();
  cout << '\n';
  ;
  for (auto i : v) {
    for (auto j : i) {
      cout << j << " ";
    }
    cout << '\n';
    ;
  }
}
int32_t main() {
  kehsihba();
  long long t = 1;
  cin >> t;
  for (long long k = 1; k <= t; k++) {
    solve();
  }
}
