#include <bits/stdc++.h>
using namespace std;
struct QwQ {
  int x1, y1, x2, y2, x3, y3;
};
char c[1010][1010];
char awa[1010][1010], qaq[1010][1010];
int n, m;
int cnt = 0;
vector<pair<int, int> > op;
vector<pair<int, int> > OP;
vector<QwQ> ans;
char cirno(char c) {
  if (c == '1')
    return '0';
  else
    return '1';
}
void solve(int x, int y) {
  op.clear();
  OP.clear();
  for (int i = x; i <= x + 1; i++)
    for (int j = y; j <= y + 1; j++) {
      if (c[i][j] == '1') op.push_back(make_pair(i, j));
    }
  if (op.size() == 0) return;
  if (op.size() == 1) {
    for (int i = x; i <= x + 1; i++)
      for (int j = y; j <= y + 1; j++) {
        if (c[i][j] == '0') OP.push_back(make_pair(i, j));
      }
    ans.push_back({OP[0].first, OP[0].second, OP[1].first, OP[1].second,
                   op[0].first, op[0].second});
    ans.push_back({op[0].first, op[0].second, OP[2].first, OP[2].second,
                   OP[0].first, OP[0].second});
    ans.push_back({op[0].first, op[0].second, OP[2].first, OP[2].second,
                   OP[1].first, OP[1].second});
  }
  if (op.size() == 2) {
    for (int i = x; i <= x + 1; i++)
      for (int j = y; j <= y + 1; j++) {
        if (c[i][j] == '0') OP.push_back(make_pair(i, j));
      }
    ans.push_back({OP[0].first, OP[0].second, OP[1].first, OP[1].second,
                   op[0].first, op[0].second});
    ans.push_back({OP[0].first, OP[0].second, OP[1].first, OP[1].second,
                   op[1].first, op[1].second});
  }
  if (op.size() == 3) {
    ans.push_back({op[0].first, op[0].second, op[1].first, op[1].second,
                   op[2].first, op[2].second});
  }
  if (op.size() == 4) {
    for (int i = x; i <= x + 1; i++)
      for (int j = y; j <= y + 1; j++) {
        if (c[i][j] == '1') OP.push_back(make_pair(i, j));
        if (OP.size() == 3) break;
      }
    ans.push_back({op[0].first, op[0].second, op[1].first, op[1].second,
                   op[2].first, op[2].second});
    ans.push_back({OP[0].first, OP[0].second, OP[1].first, OP[1].second,
                   op[3].first, op[3].second});
    ans.push_back({op[3].first, op[3].second, OP[2].first, OP[2].second,
                   OP[0].first, OP[0].second});
    ans.push_back({op[3].first, op[3].second, OP[2].first, OP[2].second,
                   OP[1].first, OP[1].second});
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    ans.clear();
    cnt = 0;
    cin >> n >> m;
    int N = n, M = m;
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= m; j++) {
        cin >> c[i][j];
        awa[i][j] = c[i][j];
        qaq[i][j] = c[i][j];
      }
    if (n % 2 && !(m % 2)) {
      for (int i = 1; i <= m / 2; i++) {
        if (c[n][i * 2 - 1] == '1' && c[n][i * 2] != '1') {
          ans.push_back({n - 1, i * 2 - 1, n - 1, i * 2, n, i * 2 - 1});
          c[n - 1][i * 2 - 1] = cirno(c[n - 1][i * 2 - 1]);
          c[n - 1][i * 2] = cirno(c[n - 1][i * 2]);
        } else if (c[n][i * 2 - 1] != '1' && c[n][i * 2] == '1') {
          ans.push_back({n - 1, i * 2 - 1, n - 1, i * 2, n, i * 2});
          c[n - 1][i * 2 - 1] = cirno(c[n - 1][i * 2 - 1]);
          c[n - 1][i * 2] = cirno(c[n - 1][i * 2]);
        } else if (c[n][i * 2 - 1] == '1' && c[n][i * 2] == '1') {
          ans.push_back({n - 1, i * 2 - 1, n, i * 2 - 1, n, i * 2});
          c[n - 1][i * 2 - 1] = cirno(c[n - 1][i * 2 - 1]);
        }
      }
      n--;
    }
    if (m % 2 && !(n % 2)) {
      for (int i = 1; i <= n / 2; i++) {
        if (c[i * 2 - 1][m] == '1' && c[i * 2][m] != '1') {
          ans.push_back({i * 2 - 1, m - 1, i * 2, m - 1, i * 2 - 1, m});
          c[i * 2 - 1][m - 1] = cirno(c[i * 2 - 1][m - 1]);
          c[i * 2][m - 1] = cirno(c[i * 2][m - 1]);
        } else if (c[i * 2 - 1][m] != '1' && c[i * 2][m] == '1') {
          ans.push_back({i * 2 - 1, m - 1, i * 2, m - 1, i * 2, m});
          c[i * 2 - 1][m - 1] = cirno(c[i * 2 - 1][m - 1]);
          c[i * 2][m - 1] = cirno(c[i * 2][m - 1]);
        } else if (c[i * 2 - 1][m] == '1' && c[i * 2][m] == '1') {
          ans.push_back({i * 2 - 1, m - 1, i * 2 - 1, m, i * 2, m});
          c[i * 2 - 1][m - 1] = cirno(c[i * 2 - 1][m - 1]);
        }
      }
      m--;
    }
    if (m % 2 && n % 2) {
      if (c[n][m] == '1') {
        ans.push_back({n - 1, m - 1, n - 1, m, n, m});
        c[n - 1][m - 1] = cirno(c[n - 1][m - 1]);
        c[n - 1][m] = cirno(c[n - 1][m]);
        c[n][m] = cirno(c[n][m]);
      }
      for (int i = 1; i <= m / 2; i++) {
        if (c[n][i * 2 - 1] == '1' && c[n][i * 2] != '1') {
          ans.push_back({n - 1, i * 2 - 1, n - 1, i * 2, n, i * 2 - 1});
          c[n - 1][i * 2 - 1] = cirno(c[n - 1][i * 2 - 1]);
          c[n - 1][i * 2] = cirno(c[n - 1][i * 2]);
        } else if (c[n][i * 2 - 1] != '1' && c[n][i * 2] == '1') {
          ans.push_back({n - 1, i * 2 - 1, n - 1, i * 2, n, i * 2});
          c[n - 1][i * 2 - 1] = cirno(c[n - 1][i * 2 - 1]);
          c[n - 1][i * 2] = cirno(c[n - 1][i * 2]);
        } else if (c[n][i * 2 - 1] == '1' && c[n][i * 2] == '1') {
          ans.push_back({n - 1, i * 2 - 1, n, i * 2 - 1, n, i * 2});
          c[n - 1][i * 2 - 1] = cirno(c[n - 1][i * 2 - 1]);
        }
      }
      for (int i = 1; i <= n / 2; i++) {
        if (c[i * 2 - 1][m] == '1' && c[i * 2][m] != '1') {
          ans.push_back({i * 2 - 1, m - 1, i * 2, m - 1, i * 2 - 1, m});
          c[i * 2 - 1][m - 1] = cirno(c[i * 2 - 1][m - 1]);
          c[i * 2][m - 1] = cirno(c[i * 2][m - 1]);
        } else if (c[i * 2 - 1][m] != '1' && c[i * 2][m] == '1') {
          ans.push_back({i * 2 - 1, m - 1, i * 2, m - 1, i * 2, m});
          c[i * 2 - 1][m - 1] = cirno(c[i * 2 - 1][m - 1]);
          c[i * 2][m - 1] = cirno(c[i * 2][m - 1]);
        } else if (c[i * 2 - 1][m] == '1' && c[i * 2][m] == '1') {
          ans.push_back({i * 2 - 1, m - 1, i * 2 - 1, m, i * 2, m});
          c[i * 2 - 1][m - 1] = cirno(c[i * 2 - 1][m - 1]);
        }
      }
      n--;
      m--;
    }
    for (int i = 1; i <= n; i += 2) {
      for (int j = 1; j <= m; j += 2) {
        solve(i, j);
      }
    }
    cout << ans.size() << endl;
    for (int i = 0; i < ans.size(); i++) {
      cout << ans[i].x1 << " " << ans[i].y1 << " " << ans[i].x2 << " "
           << ans[i].y2 << " " << ans[i].x3 << " " << ans[i].y3 << endl;
      awa[ans[i].x1][ans[i].y1] = cirno(awa[ans[i].x1][ans[i].y1]);
      awa[ans[i].x2][ans[i].y2] = cirno(awa[ans[i].x2][ans[i].y2]);
      awa[ans[i].x3][ans[i].y3] = cirno(awa[ans[i].x3][ans[i].y3]);
    }
  }
  return 0;
  cout << "UUZ ate it." << endl;
}
