#include <bits/stdc++.h>
using namespace std;
const int dx[] = {0, 1, 0, 1}, dy[] = {0, 0, 1, 1};
const int maxn = 105;
const int maxm = 105;
struct Ans {
  int x1, y1, x2, y2, x3, y3;
  Ans(int a, int b, int c, int d, int e, int f)
      : x1(a), y1(b), x2(c), y2(d), x3(e), y3(f) {}
};
int n, m, a[maxn][maxm];
int main(void) {
  int tc;
  scanf("%d", &tc);
  while (tc--) {
    scanf("%d%d", &n, &m);
    vector<pair<int, int> > ord;
    vector<Ans> ans;
    for (int i = 1; i <= n; ++i)
      for (int j = 1; j <= m; ++j) {
        scanf("%1d", &a[i][j]);
        ord.emplace_back(i, j);
      }
    sort((ord).begin(), (ord).end(), [](pair<int, int> l, pair<int, int> r) {
      return pair<int, int>(l.second, l.first) <
             pair<int, int>(r.second, r.first);
    });
    for (auto& [x, y] : ord) {
      if (y > m - 2) break;
      if (!a[x][y] && !a[x + dx[1]][y + dy[1]]) continue;
      vector<pair<int, int> > v;
      int cnt = 3;
      for (int i = 0; i < 4; ++i) {
        int nx = x + dx[i], ny = y + dy[i];
        if (cnt == 4 - i || (cnt > 0 && a[nx][ny])) {
          v.emplace_back(nx, ny);
          a[nx][ny] = !a[nx][ny];
          --cnt;
        }
      }
      ans.emplace_back(v[0].first, v[0].second, v[1].first, v[1].second,
                       v[2].first, v[2].second);
    }
    int y = m - 1;
    for (int x = 1; x <= n - 2; ++x) {
      if (!a[x][y] && !a[x][y + 1]) continue;
      vector<pair<int, int> > v;
      int cnt = 3;
      if (a[x][y]) {
        v.emplace_back(x, y);
        a[x][y] = 0;
        --cnt;
      }
      if (a[x][y + 1]) {
        v.emplace_back(x, y + 1);
        a[x][y + 1] = 0;
        --cnt;
      }
      if (cnt > 0) {
        v.emplace_back(x + 1, y + 1);
        a[x + 1][y + 1] = !a[x + 1][y + 1];
        --cnt;
      }
      if (cnt > 0) {
        v.emplace_back(x + 1, y);
        a[x + 1][y] = !a[x + 1][y];
        --cnt;
      }
      ans.emplace_back(v[0].first, v[0].second, v[1].first, v[1].second,
                       v[2].first, v[2].second);
    }
    int cnt = a[n - 1][m - 1] + a[n - 1][m] + a[n][m - 1] + a[n][m];
    if (cnt == 4) {
      ans.emplace_back(n - 1, m - 1, n - 1, m, n, m - 1);
      a[n - 1][m - 1] = a[n - 1][m] = a[n][m - 1] = 0;
      cnt = 1;
    }
    if (cnt == 1) {
      if (a[n][m]) {
        ans.emplace_back(n - 1, m - 1, n, m - 1, n, m);
        a[n - 1][m - 1] = !a[n - 1][m - 1];
        a[n][m - 1] = !a[n][m - 1];
        a[n][m] = !a[n][m];
      } else {
        ans.emplace_back(n - 1, m - 1, n, m - 1, n - 1, m);
        a[n - 1][m - 1] = !a[n - 1][m - 1];
        a[n][m - 1] = !a[n][m - 1];
        a[n - 1][m] = !a[n - 1][m];
      }
      cnt = 2;
    }
    if (cnt == 2) {
      int x = n - 1, y = m - 1;
      int j = -1;
      for (int i = 0; i < 4; ++i) {
        if (a[x + dx[i]][y + dy[i]]) {
          j = i;
          break;
        }
      }
      vector<pair<int, int> > v;
      for (int i = 0; i < 4; ++i)
        if (i != j) {
          int nx = x + dx[i], ny = y + dy[i];
          a[nx][ny] = !a[nx][ny];
          v.emplace_back(nx, ny);
        }
      ans.emplace_back(v[0].first, v[0].second, v[1].first, v[1].second,
                       v[2].first, v[2].second);
      cnt = 3;
    }
    if (cnt == 3) {
      int x = n - 1, y = m - 1;
      vector<pair<int, int> > v;
      for (int i = 0; i < 4; ++i) {
        int nx = x + dx[i], ny = y + dy[i];
        if (!a[nx][ny]) continue;
        a[nx][ny] = !a[nx][ny];
        v.emplace_back(nx, ny);
      }
      ans.emplace_back(v[0].first, v[0].second, v[1].first, v[1].second,
                       v[2].first, v[2].second);
      cnt = 0;
    }
    printf("%d\n", ans.size());
    for (auto& t : ans)
      printf("%d %d %d %d %d %d\n", t.x1, t.y1, t.x2, t.y2, t.x3, t.y3);
  }
  return 0;
}
