#include <bits/stdc++.h>
using namespace std;
double const pi = 3.14159265358979323;
const int mod = 1000000007;
const int inf = 1e9 + 1;
void solve(void);
char B[100][100];
int A[100][100];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(10);
  int t = 1;
  cin >> t;
  for (int i = 0; i < t; i++) solve();
  return 0;
}
void solve() {
  int n, m;
  cin >> n >> m;
  long long k = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) cin >> B[i][j];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) A[i][j] = B[i][j] - '0';
  queue<int> Q;
  for (int i = 0; i < n - 2; i++)
    for (int j = 0; j < m; j++) {
      if (A[i][j] == 0) continue;
      k++;
      if (j != m - 1) {
        if (A[i][j] == A[i][j + 1]) {
          Q.push(i);
          Q.push(j);
          Q.push(i);
          Q.push(j + 1);
          Q.push(i + 1);
          Q.push(j + 1);
          A[i][j] = 0;
          A[i + 1][j + 1]++;
          A[i + 1][j + 1] %= 2;
          A[i][j + 1] = 0;
        } else {
          Q.push(i);
          Q.push(j);
          Q.push(i + 1);
          Q.push(j);
          Q.push(i + 1);
          Q.push(j + 1);
          A[i][j] = 0;
          A[i + 1][j]++;
          A[i + 1][j] %= 2;
          A[i + 1][j + 1]++;
          A[i + 1][j + 1] %= 2;
        }
      } else {
        Q.push(i);
        Q.push(j);
        Q.push(i + 1);
        Q.push(j);
        Q.push(i + 1);
        Q.push(j - 1);
        A[i][j] = 0;
        A[i + 1][j]++;
        A[i + 1][j] %= 2;
        A[i + 1][j - 1]++;
        A[i + 1][j - 1] %= 2;
      }
    }
  for (int j = 0; j < m - 2; j++) {
    if (A[n - 2][j] == A[n - 1][j] && A[n - 2][j] == 1) {
      k++;
      Q.push(n - 2);
      Q.push(j);
      Q.push(n - 1);
      Q.push(j);
      Q.push(n - 1);
      Q.push(j + 1);
      A[n - 1][j + 1]++;
      A[n - 1][j + 1] %= 2;
    } else {
      if (A[n - 2][j] == 1) {
        k++;
        Q.push(n - 2);
        Q.push(j);
        Q.push(n - 2);
        Q.push(j + 1);
        Q.push(n - 1);
        Q.push(j + 1);
        A[n - 1][j + 1]++;
        A[n - 1][j + 1] %= 2;
        A[n - 2][j + 1]++;
        A[n - 2][j + 1] %= 2;
      }
      if (A[n - 1][j] == 1) {
        k++;
        Q.push(n - 1);
        Q.push(j);
        Q.push(n - 2);
        Q.push(j + 1);
        Q.push(n - 1);
        Q.push(j + 1);
        A[n - 1][j + 1]++;
        A[n - 1][j + 1] %= 2;
        A[n - 2][j + 1]++;
        A[n - 2][j + 1] %= 2;
      }
    }
  }
  long long s =
      A[n - 2][m - 2] + A[n - 1][m - 1] + A[n - 1][m - 2] + A[n - 2][m - 1];
  if (s == 4) {
    k++;
    s = 1;
    Q.push(n - 2);
    Q.push(m - 2);
    A[n - 2][m - 2] = 0;
    Q.push(n - 1);
    Q.push(m - 2);
    A[n - 1][m - 2] = 0;
    Q.push(n - 2);
    Q.push(m - 1);
    A[n - 2][m - 1] = 0;
  }
  if (s == 1) {
    k++;
    s++;
    bool fl = true;
    int i1, j1, i2, j2, i3, j3;
    for (int i = 0; i < 2; i++)
      for (int j = 0; j < 2; j++)
        if (A[n - 2 + i][m - 2 + j] == 1) {
          i3 = n - 2 + i;
          j3 = m - 2 + j;
        } else if (fl) {
          i1 = n - 2 + i;
          j1 = m - 2 + j;
          fl = false;
        } else {
          i2 = n - 2 + i;
          j2 = m - 2 + j;
        }
    Q.push(i1);
    Q.push(j1);
    Q.push(i2);
    Q.push(j2);
    Q.push(i3);
    Q.push(j3);
    A[i1][j1] = 1;
    A[i2][j2] = 1;
    A[i3][j3] = 0;
  }
  if (s == 2) {
    k++;
    s++;
    bool fl = true;
    int i1, j1, i2, j2, i3, j3;
    for (int i = 0; i < 2; i++)
      for (int j = 0; j < 2; j++)
        if (A[n - 2 + i][m - 2 + j] == 1) {
          i3 = n - 2 + i;
          j3 = m - 2 + j;
        } else if (fl) {
          i1 = n - 2 + i;
          j1 = m - 2 + j;
          fl = false;
        } else {
          i2 = n - 2 + i;
          j2 = m - 2 + j;
        }
    Q.push(i1);
    Q.push(j1);
    Q.push(i2);
    Q.push(j2);
    Q.push(i3);
    Q.push(j3);
    A[i1][j1] = 1;
    A[i2][j2] = 1;
    A[i3][j3] = 0;
  }
  if (s == 3) {
    k++;
    for (int i = 0; i < 2; i++)
      for (int j = 0; j < 2; j++)
        if (A[n - 2 + i][m - 2 + j] == 1) {
          Q.push(n - 2 + i);
          Q.push(m - 2 + j);
        }
  }
  cout << k << '\n';
  while (!Q.empty()) {
    cout << Q.front() + 1 << ' ';
    Q.pop();
  }
}
