#include <bits/stdc++.h>
using namespace std;
const int MX = 200;
long long A[MX][MX];
void apply(vector<pair<long long, long long>> &v) {
  assert(v.size() == 3);
  for (int i = 0; i < v.size(); i++) {
    for (int j = 0; j < v.size(); j++) {
      if (i != j) assert(v[i] != v[j]);
    }
  }
  for (auto op : v) {
    A[op.first][op.second] ^= 1;
  }
}
void generate(vector<pair<long long, long long>> positions,
              vector<vector<pair<long long, long long>>> &operations) {
  long long c1 = 0;
  for (auto p : positions) {
    if (A[p.first][p.second] == 1) c1++;
  }
  if (c1 == 0) return;
  if (c1 == 3) {
    vector<pair<long long, long long>> op;
    for (auto p : positions) {
      if (A[p.first][p.second] == 1) {
        op.push_back(p);
      }
    }
    operations.push_back(op);
    apply(op);
  } else if (c1 == 2) {
    vector<pair<long long, long long>> op;
    for (auto p : positions) {
      if (A[p.first][p.second] == 0) {
        op.push_back(p);
      }
    }
    for (auto p : positions) {
      if (A[p.first][p.second] == 1) {
        op.push_back(p);
        break;
      }
    }
    operations.push_back(op);
    apply(op);
  } else if (c1 == 1) {
    vector<pair<long long, long long>> op;
    for (auto p : positions) {
      if (A[p.first][p.second] == 1) {
        op.push_back(p);
        break;
      }
    }
    long long cnt0 = 0;
    for (auto p : positions) {
      if (A[p.first][p.second] == 0) {
        op.push_back(p);
        cnt0++;
      }
      if (cnt0 == 2) break;
    }
    operations.push_back(op);
    apply(op);
  } else {
    assert(c1 == 4);
    vector<pair<long long, long long>> op;
    for (long long i = 0; i < 3; i++) {
      op.push_back(positions[i]);
    }
    operations.push_back(op);
    apply(op);
  }
  return generate(positions, operations);
}
void solve() {
  long long n, m;
  cin >> n >> m;
  for (long long i = 0; i < (long long)n; i++) {
    string s;
    cin >> s;
    for (long long j = 0; j < (long long)m; j++) {
      A[i][j] = s[j] - '0';
    }
  }
  vector<vector<pair<long long, long long>>> operations;
  for (long long i = 0; i < n - 2; i++) {
    for (long long j = 0; j < m; j++) {
      if (A[i][j] == 1) {
        vector<pair<long long, long long>> op = {{i, j}, {i + 1, j}};
        if (j != 0) {
          op.push_back({i + 1, j - 1});
        } else {
          op.push_back({i + 1, j + 1});
        }
        if (!op.empty()) {
          apply(op);
          operations.push_back(op);
        }
      }
    }
  }
  for (long long j = 0; j < m - 2; j++) {
    vector<pair<long long, long long>> op;
    if (A[n - 2][j] == 1 && A[n - 1][j] == 1) {
      op = {{n - 2, j}, {n - 1, j}, {n - 2, j + 1}};
    } else if (A[n - 2][j] == 1) {
      op = {{n - 2, j}, {n - 1, j + 1}, {n - 2, j + 1}};
    } else if (A[n - 1][j] == 1) {
      op = {{n - 1, j}, {n - 1, j + 1}, {n - 2, j + 1}};
    }
    if (!op.empty()) {
      apply(op);
      operations.push_back(op);
    }
  }
  vector<vector<pair<long long, long long>>> lastOper;
  generate({{n - 2, m - 2}, {n - 2, m - 1}, {n - 1, m - 2}, {n - 1, m - 1}},
           lastOper);
  for (auto op : lastOper) {
    operations.push_back(op);
  }
  cout << operations.size() << endl;
  assert(operations.size() <= 3 * m * n);
  for (auto op : operations) {
    for (auto p : op) {
      cout << p.first + 1 << " " << p.second + 1 << " ";
    }
    cout << "\n";
  }
  for (long long i = 0; i < (long long)n; i++) {
    for (long long j = 0; j < (long long)m; j++) {
      assert(A[i][j] == 0);
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long T;
  cin >> T;
  for (long long t = 0; t < (long long)T; t++) {
    solve();
  }
  return 0;
}
