#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long fastPow(long long base, long long exp, long long mod) {
  long long res = 1;
  while (exp > 0) {
    if (exp % 2 == 1) res = ((res % mod) * (base % mod)) % mod;
    base = ((base % mod) * (base % mod)) % mod;
    exp /= 2;
  }
  return res % mod;
}
void flip(char& ch) { (ch == '0' ? ch = '1' : ch = '0'); }
void solve() {
  long long n, m;
  cin >> n >> m;
  string s[n];
  for (long long i = 0; i < n; i++) {
    cin >> s[i];
  }
  vector<vector<pair<long long, long long>>> ans;
  long long i = 0, j = 0;
  while (i < n - 2) {
    j = 0;
    while (j < m - 1) {
      if (s[i][j] == '1') {
        vector<pair<long long, long long>> temp;
        temp.push_back({i, j}), flip(s[i][j]);
        temp.push_back({i + 1, j}), flip(s[i + 1][j]);
        temp.push_back({i + 1, j + 1}), flip(s[i + 1][j + 1]);
        ans.push_back(temp);
      }
      j++;
    }
    if (s[i][m - 1] == '1') {
      vector<pair<long long, long long>> temp;
      temp.push_back({i, m - 1}), flip(s[i][m - 1]);
      temp.push_back({i + 1, m - 1}), flip(s[i + 1][m - 1]);
      temp.push_back({i + 1, m - 2}), flip(s[i + 1][m - 2]);
      ans.push_back(temp);
    }
    i++;
  }
  j = 0;
  if (m & 1) {
    if (s[n - 2][0] == '1' && s[n - 1][0] == '1') {
      vector<pair<long long, long long>> temp;
      temp.push_back({n - 2, 0}), flip(s[n - 2][0]);
      temp.push_back({n - 1, 0}), flip(s[n - 1][0]);
      temp.push_back({n - 1, 1}), flip(s[n - 1][1]);
      ans.push_back(temp);
    } else if (s[n - 2][0] == '1' && s[n - 1][0] == '0') {
      vector<pair<long long, long long>> temp;
      temp.push_back({n - 2, 0}), flip(s[n - 2][0]);
      temp.push_back({n - 2, 1}), flip(s[n - 2][1]);
      temp.push_back({n - 1, 1}), flip(s[n - 1][1]);
      ans.push_back(temp);
    } else if (s[n - 2][0] == '0' && s[n - 1][0] == '1') {
      vector<pair<long long, long long>> temp;
      temp.push_back({n - 1, 0}), flip(s[n - 1][0]);
      temp.push_back({n - 2, 1}), flip(s[n - 2][1]);
      temp.push_back({n - 1, 1}), flip(s[n - 1][1]);
      ans.push_back(temp);
    }
    j++;
  }
  while (j < m) {
    vector<pair<long long, long long>> p0, p1;
    (s[i][j] == '0' ? p0.push_back({i, j}) : p1.push_back({i, j}));
    s[i][j] = '0';
    (s[i + 1][j] == '0' ? p0.push_back({i + 1, j}) : p1.push_back({i + 1, j}));
    s[i + 1][j] = '0';
    (s[i][j + 1] == '0' ? p0.push_back({i, j + 1}) : p1.push_back({i, j + 1}));
    s[i][j + 1] = '0';
    (s[i + 1][j + 1] == '0' ? p0.push_back({i + 1, j + 1})
                            : p1.push_back({i + 1, j + 1}));
    s[i + 1][j + 1] = '0';
    if (p1.size() == 4) {
      vector<pair<long long, long long>> temp, tp0, tp1;
      temp.push_back(p1[0]);
      temp.push_back(p1[1]);
      temp.push_back(p1[2]);
      tp0.push_back(p1[0]), tp0.push_back(p1[1]), tp0.push_back(p1[2]);
      tp1.push_back(p1[3]);
      ans.push_back(temp), p0 = tp0, p1 = tp1;
    }
    if (p1.size() == 1) {
      vector<pair<long long, long long>> temp, tp0, tp1;
      temp.push_back(p1[0]);
      temp.push_back(p0[2]);
      temp.push_back(p0[1]);
      tp1.push_back(p0[1]), tp1.push_back(p0[2]);
      tp0.push_back(p1[0]), tp0.push_back(p0[0]);
      ans.push_back(temp), p0 = tp0, p1 = tp1;
    }
    if (p1.size() == 2) {
      vector<pair<long long, long long>> temp, tp0, tp1;
      temp.push_back(p1[0]);
      temp.push_back(p0[0]);
      temp.push_back(p0[1]);
      tp1.push_back(p0[0]), tp1.push_back(p0[1]), tp1.push_back(p1[1]);
      tp0.push_back(p1[0]);
      ans.push_back(temp), p0 = tp0, p1 = tp1;
    }
    if (p1.size() == 3) {
      vector<pair<long long, long long>> temp, tp0, tp1;
      temp.push_back(p1[0]);
      temp.push_back(p1[1]);
      temp.push_back(p1[2]);
      tp0.push_back(p1[0]), tp0.push_back(p1[1]), tp0.push_back(p1[2]),
          tp0.push_back(p0[0]);
      ans.push_back(temp), p0 = tp0, p1 = tp1;
    }
    j += 2;
  }
  cout << ans.size() << "\n";
  for (long long i = 0; i < ans.size(); i++) {
    for (long long j = 0; j < 3; j++) {
      cout << ans[i][j].first + 1 << " " << ans[i][j].second + 1 << " ";
    }
    cout << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long tc = 1;
  cin >> tc;
  while (tc--) {
    solve();
  }
  return 0;
}
