#include <bits/stdc++.h>
using namespace std;
struct step {
  int x[3], y[3];
};
vector<step> ans;
bool solve(int r, int c, vector<string> &v) {
  vector<pair<int, int> > v0, v1;
  for (int i = (0); i < (2); i++)
    for (int j = (0); j < (2); j++)
      if (v[r + i][c + j] == '0')
        v0.push_back(make_pair(r + i, c + j));
      else
        v1.push_back(make_pair(r + i, c + j));
  if (v1.empty()) return true;
  ans.push_back(step());
  if (v1.size() >= 3) {
    for (int i = (0); i < (3); i++) {
      ans.back().x[i] = v1[i].first;
      ans.back().y[i] = v1[i].second;
      v[v1[i].first][v1[i].second] = '0';
    }
  } else {
    for (int i = (0); i < (2); i++) {
      ans.back().x[i] = v0[i].first;
      ans.back().y[i] = v0[i].second;
      v[v0[i].first][v0[i].second] = '1';
    }
    ans.back().x[2] = v1[0].first;
    ans.back().y[2] = v1[0].second;
    v[v1[0].first][v1[0].second] = '0';
  }
  return false;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  for (int T = (0); T < (t); T++) {
    int n, m;
    cin >> n >> m;
    vector<string> v(n);
    for (int i = (0); i < (n); i++) cin >> v[i];
    int r = 0, c = 0;
    if (n % 2) {
      while (c < m) {
        if (c == m - 1) c--;
        if (v[r][c] == '1' || v[r][c + 1] == '1') {
          int aux = 0;
          ans.push_back(step());
          if (v[r][c] == '1') {
            ans.back().x[aux] = r;
            ans.back().y[aux] = c;
            v[r][c] = '0';
            aux++;
          }
          if (v[r][c + 1] == '1') {
            ans.back().x[aux] = r;
            ans.back().y[aux] = c + 1;
            v[r][c + 1] = '0';
            aux++;
          }
          ans.back().x[aux] = r + 1;
          ans.back().y[aux] = c;
          if (v[r + 1][c] == '0')
            v[r + 1][c] = '1';
          else
            v[r + 1][c] = '0';
          aux++;
          if (aux < 3) {
            ans.back().x[aux] = r + 1;
            ans.back().y[aux] = c + 1;
            if (v[r + 1][c + 1] == '0')
              v[r + 1][c + 1] = '1';
            else
              v[r + 1][c + 1] = '0';
          }
        }
        c += 2;
      }
    }
    c = 0;
    r = n % 2;
    if (m % 2) {
      while (r < n) {
        if (r == n - 1) r--;
        if (v[r][c] == '1' || v[r + 1][c] == '1') {
          int aux = 0;
          ans.push_back(step());
          if (v[r][c] == '1') {
            ans.back().x[aux] = r;
            ans.back().y[aux] = c;
            v[r][c] = '0';
            aux++;
          }
          if (v[r + 1][c] == '1') {
            ans.back().x[aux] = r + 1;
            ans.back().y[aux] = c;
            v[r + 1][c] = '0';
            aux++;
          }
          ans.back().x[aux] = r;
          ans.back().y[aux] = c + 1;
          if (v[r][c + 1] == '0')
            v[r][c + 1] = '1';
          else
            v[r][c + 1] = '0';
          aux++;
          if (aux < 3) {
            ans.back().x[aux] = r + 1;
            ans.back().y[aux] = c + 1;
            if (v[r + 1][c + 1] == '0')
              v[r + 1][c + 1] = '1';
            else
              v[r + 1][c + 1] = '0';
          }
        }
        r += 2;
      }
    }
    r = n % 2;
    while (r < n) {
      c = m % 2;
      assert(r < n - 1);
      while (c < m) {
        assert(c < m - 1);
        while (!solve(r, c, v))
          ;
        c += 2;
      }
      r += 2;
    }
    cout << ((int)ans.size()) << '\n';
    for (int i = (0); i < (((int)ans.size())); i++) {
      for (int j = (0); j < (3); j++)
        cout << ans[i].x[j] + 1 << ' ' << ans[i].y[j] + 1 << ' ';
      cout << '\n';
    }
    ans.clear();
  }
  return 0;
}
