#include <bits/stdc++.h>
using namespace std;
void solve();
void pre();
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long t;
  t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
inline void solve() {
  long long n, m, i, j, c1;
  cin >> n >> m;
  char s[n][m];
  char a, b, c, d;
  vector<vector<long long>> ans;
  vector<pair<long long, long long>> o, z;
  vector<long long> v;
  ans.clear();
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) cin >> s[i][j];
  }
  for (j = m - 1; j > 1; j--) {
    for (i = 0; i < n; i++) {
      if (s[i][j] == '1') {
        if (i != n - 1) {
          ans.push_back({i + 1, j + 1, i + 1, j, i + 2, j});
          if (s[i][j - 1] == '0')
            s[i][j - 1] = '1';
          else
            s[i][j - 1] = '0';
          if (s[i + 1][j - 1] == '0')
            s[i + 1][j - 1] = '1';
          else
            s[i + 1][j - 1] = '0';
        } else {
          ans.push_back({i + 1, j + 1, i + 1, j, i, j});
          if (s[i][j - 1] == '0')
            s[i][j - 1] = '1';
          else
            s[i][j - 1] = '0';
          if (s[i - 1][j - 1] == '0')
            s[i - 1][j - 1] = '1';
          else
            s[i - 1][j - 1] = '0';
        }
      }
    }
  }
  if (n % 2 == 1) {
    a = s[n - 1][0];
    b = s[n - 1][1];
    if (a == '1' && b == '1') {
      ans.push_back({n, 1, n, 2, n - 1, 1});
      if (s[n - 2][0] == '0')
        s[n - 2][0] = '1';
      else
        s[n - 2][0] = '0';
    } else if (a == '1') {
      ans.push_back({n, 1, n - 1, 1, n - 1, 2});
      if (s[n - 2][0] == '0')
        s[n - 2][0] = '1';
      else
        s[n - 2][0] = '0';
      if (s[n - 2][1] == '0')
        s[n - 2][1] = '1';
      else
        s[n - 2][1] = '0';
    } else if (b == '1') {
      ans.push_back({n, 2, n - 1, 2, n - 1, 1});
      if (s[n - 2][0] == '0')
        s[n - 2][0] = '1';
      else
        s[n - 2][0] = '0';
      if (s[n - 2][1] == '0')
        s[n - 2][1] = '1';
      else
        s[n - 2][1] = '0';
    }
    n = n - 1;
  }
  j = 0;
  for (i = 0; i < n; i += 2) {
    c1 = 0;
    a = s[i][j];
    b = s[i][j + 1];
    c = s[i + 1][j];
    d = s[i + 1][j + 1];
    o.clear();
    z.clear();
    v.clear();
    if (a == '1') {
      c1++;
      o.push_back({i + 1, j + 1});
    }
    if (a == '0') {
      z.push_back({i + 1, j + 1});
    }
    if (b == '1') {
      c1++;
      o.push_back({i + 1, j + 2});
    }
    if (b == '0') {
      z.push_back({i + 1, j + 2});
    }
    if (c == '1') {
      c1++;
      o.push_back({i + 2, j + 1});
    }
    if (c == '0') {
      z.push_back({i + 2, j + 1});
    }
    if (d == '1') {
      c1++;
      o.push_back({i + 2, j + 2});
    }
    if (d == '0') {
      z.push_back({i + 2, j + 2});
    }
    if (c1 == 1) {
      v.push_back(o[0].first);
      v.push_back(o[0].second);
      v.push_back(z[0].first);
      v.push_back(z[0].second);
      v.push_back(z[1].first);
      v.push_back(z[1].second);
      ans.push_back(v);
      v.clear();
      v.push_back(o[0].first);
      v.push_back(o[0].second);
      v.push_back(z[1].first);
      v.push_back(z[1].second);
      v.push_back(z[2].first);
      v.push_back(z[2].second);
      ans.push_back(v);
      v.clear();
      v.push_back(o[0].first);
      v.push_back(o[0].second);
      v.push_back(z[0].first);
      v.push_back(z[0].second);
      v.push_back(z[2].first);
      v.push_back(z[2].second);
      ans.push_back(v);
      v.clear();
    } else if (c1 == 2) {
      v.push_back(o[0].first);
      v.push_back(o[0].second);
      v.push_back(z[0].first);
      v.push_back(z[0].second);
      v.push_back(z[1].first);
      v.push_back(z[1].second);
      ans.push_back(v);
      v.clear();
      v.push_back(z[0].first);
      v.push_back(z[0].second);
      v.push_back(z[1].first);
      v.push_back(z[1].second);
      v.push_back(o[1].first);
      v.push_back(o[1].second);
      ans.push_back(v);
      v.clear();
    } else if (c1 == 3) {
      v.push_back(o[0].first);
      v.push_back(o[0].second);
      v.push_back(o[1].first);
      v.push_back(o[1].second);
      v.push_back(o[2].first);
      v.push_back(o[2].second);
      ans.push_back(v);
      v.clear();
    } else if (c1 == 4) {
      v.push_back(o[0].first);
      v.push_back(o[0].second);
      v.push_back(o[1].first);
      v.push_back(o[1].second);
      v.push_back(o[2].first);
      v.push_back(o[2].second);
      ans.push_back(v);
      v.clear();
      v.push_back(o[0].first);
      v.push_back(o[0].second);
      v.push_back(o[1].first);
      v.push_back(o[1].second);
      v.push_back(o[3].first);
      v.push_back(o[3].second);
      ans.push_back(v);
      v.clear();
      v.push_back(o[1].first);
      v.push_back(o[1].second);
      v.push_back(o[2].first);
      v.push_back(o[2].second);
      v.push_back(o[3].first);
      v.push_back(o[3].second);
      ans.push_back(v);
      v.clear();
      v.push_back(o[0].first);
      v.push_back(o[0].second);
      v.push_back(o[2].first);
      v.push_back(o[2].second);
      v.push_back(o[3].first);
      v.push_back(o[3].second);
      ans.push_back(v);
      v.clear();
    }
  }
  long long y = ans.size();
  cout << y << "\n";
  for (auto k : ans) {
    for (auto p : k) cout << p << " ";
    cout << "\n";
  }
}
