#include <bits/stdc++.h>
using namespace std;
const long long int N = 105;
char ar[N][N];
long long int cnt = 0;
vector<long long int> v[3 * N * N];
pair<long long int, long long int> pos[] = {{0, 0}, {0, 1}, {1, 0}, {1, 1}};
void solve3(long long int i, long long int j) {
  long long int x1 = -1, y1 = -1, x2 = -1, y2 = -1, x3 = -1, y3 = -1;
  for (pair<long long int, long long int> x : pos) {
    if (ar[i + x.first][j + x.second] == '1') {
      if (x1 == -1)
        x1 = i + x.first, y1 = j + x.second;
      else if (x2 == -1)
        x2 = i + x.first, y2 = j + x.second;
      else
        x3 = i + x.first, y3 = j + x.second;
    }
  }
  ar[x1][y1] = '0';
  ar[x2][y2] = ar[x3][y3] = '0';
  vector<long long int> v1 = {x1, y1, x2, y2, x3, y3};
  for (long long int i = 0; i < 6; i++) v[cnt].emplace_back(v1[i] + 1);
  cnt++;
}
void solve2(long long int i, long long int j) {
  long long int x1 = -1, y1 = -1, x2 = -1, y2 = -1, x3 = -1, y3 = -1;
  for (pair<long long int, long long int> x : pos) {
    if (ar[i + x.first][j + x.second] == '1')
      x1 = i + x.first, y1 = j + x.second;
    else {
      if (x2 == -1)
        x2 = i + x.first, y2 = j + x.second;
      else
        x3 = i + x.first, y3 = j + x.second;
    }
  }
  ar[x1][y1] = '0';
  ar[x2][y2] = ar[x3][y3] = '1';
  vector<long long int> v1 = {x1, y1, x2, y2, x3, y3};
  for (long long int i = 0; i < 6; i++) v[cnt].emplace_back(v1[i] + 1);
  cnt++;
  solve3(i, j);
}
void solve1(long long int i, long long int j) {
  long long int x1 = -1, y1 = -1, x2 = -1, y2 = -1, x3 = -1, y3 = -1;
  for (pair<long long int, long long int> x : pos) {
    if (ar[i + x.first][j + x.second] == '1')
      x1 = i + x.first, y1 = j + x.second;
    else {
      if (x2 == -1)
        x2 = i + x.first, y2 = j + x.second;
      else
        x3 = i + x.first, y3 = j + x.second;
    }
  }
  ar[x1][y1] = '0';
  ar[x2][y2] = ar[x3][y3] = '1';
  vector<long long int> v1 = {x1, y1, x2, y2, x3, y3};
  for (long long int i = 0; i < 6; i++) v[cnt].emplace_back(v1[i] + 1);
  cnt++;
  solve2(i, j);
}
void solve4(long long int i, long long int j) {
  long long int x1 = i, y1 = j, x2 = i + 1, y2 = j, x3 = i, y3 = j + 1;
  ar[x1][y1] = '0';
  ar[x2][y2] = ar[x3][y3] = '0';
  vector<long long int> v1 = {x1, y1, x2, y2, x3, y3};
  for (long long int i = 0; i < 6; i++) v[cnt].emplace_back(v1[i] + 1);
  cnt++;
  solve1(i, j);
}
void counter(long long int i, long long int j) {
  long long int c = 0;
  for (pair<long long int, long long int> x : pos) {
    if (ar[i + x.first][j + x.second] == '1') c++;
  }
  if (c == 1)
    solve1(i, j);
  else if (c == 2)
    solve2(i, j);
  else if (c == 3)
    solve3(i, j);
  else if (c == 4)
    solve4(i, j);
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    long long int i, j, k, n, m, ans = 0, sum = 0;
    cin >> n >> m;
    cnt = 0;
    for (i = 0; i < n; i++)
      for (j = 0; j < m; j++) cin >> ar[i][j];
    if (n & 1) {
      for (i = 0; i < m - 1; i++) {
        if (ar[n - 1][i] == '1') {
          vector<long long int> v1 = {n - 1, i, n - 2, i, n - 1, i + 1};
          ar[n - 1][i] = '1';
          ar[n - 2][i] = ar[n - 2][i] == '1' ? '0' : '1';
          ar[n - 1][i + 1] = ar[n - 1][i + 1] == '1' ? '0' : '1';
          for (j = 0; j < 6; j++) v[cnt].emplace_back(v1[j] + 1);
          cnt++;
        }
      }
      if (ar[n - 1][m - 1] == '1') {
        vector<long long int> v1 = {n - 1, m - 1, n - 2, m - 1, n - 2, m - 2};
        ar[n - 1][m - 1] = '1';
        ar[n - 2][m - 1] = ar[n - 2][m - 1] == '1' ? '0' : '1';
        ar[n - 2][m - 2] = ar[n - 2][m - 2] == '1' ? '0' : '1';
        for (j = 0; j < 6; j++) v[cnt].emplace_back(v1[j] + 1);
        cnt++;
      }
      n--;
    }
    if (m & 1) {
      for (i = 0; i < n - 1; i++) {
        if (ar[i][m - 1] == '1') {
          vector<long long int> v1 = {i, m - 1, i, m - 2, i + 1, m - 1};
          ar[i][m - 1] = '1';
          ar[i][m - 2] = ar[i][m - 2] == '1' ? '0' : '1';
          ar[i + 1][m - 1] = ar[i + 1][m - 1] == '1' ? '0' : '1';
          for (j = 0; j < 6; j++) v[cnt].emplace_back(v1[j] + 1);
          cnt++;
        }
      }
      if (ar[n - 1][m - 1] == '1') {
        vector<long long int> v1 = {n - 1, m - 1, n - 1, m - 2, n - 2, m - 2};
        ar[n - 1][m - 1] = '1';
        ar[n - 1][m - 2] = ar[n - 1][m - 2] == '1' ? '0' : '1';
        ar[n - 2][m - 2] = ar[n - 2][m - 2] == '1' ? '0' : '1';
        for (j = 0; j < 6; j++) v[cnt].emplace_back(v1[j] + 1);
        cnt++;
      }
      m--;
    }
    for (i = 0; i < n; i += 2) {
      for (j = 0; j < m; j += 2) counter(i, j);
    }
    cout << cnt << '\n';
    for (i = 0; i < cnt; i++) {
      for (j = 0; j < 6; j++) cout << v[i][j] << ' ';
      v[i].clear();
      cout << '\n';
    }
  }
  return 0;
}
