#include <bits/stdc++.h>
using namespace std;
long long int exp(long long int x, long long int y) {
  long long int res = 1;
  x = x % (long long int)(1e9 + 7);
  while (y > 0) {
    if (y & 1) res = (res * x) % (long long int)(1e9 + 7);
    y = y >> 1;
    x = (x * x) % (long long int)(1e9 + 7);
  }
  return res;
}
long long int modinv(long long int x) {
  return exp(x, (long long int)(1e9 + 7) - 2);
}
long long int add(long long int a, long long int b) {
  a %= (long long int)(1e9 + 7), b %= (long long int)(1e9 + 7);
  a = ((a + b) % (long long int)(1e9 + 7) + (long long int)(1e9 + 7)) %
      (long long int)(1e9 + 7);
  return a;
}
long long int sub(long long int a, long long int b) {
  a = ((a - b) % (long long int)(1e9 + 7) + (long long int)(1e9 + 7)) %
      (long long int)(1e9 + 7);
  return a;
}
long long int mul(long long int a, long long int b) {
  a %= (long long int)(1e9 + 7), b %= (long long int)(1e9 + 7);
  a = ((a * b) % (long long int)(1e9 + 7) + (long long int)(1e9 + 7)) %
      (long long int)(1e9 + 7);
  return a;
}
long long int res;
long long int a[103][103];
vector<long long int> ans[10004];
void op3(long long int i, long long int j) {
  vector<pair<long long int, long long int>> v;
  if (a[i][j] == 1) v.push_back({i, j});
  if (a[i + 1][j] == 1) v.push_back({i + 1, j});
  if (a[i][j + 1] == 1) v.push_back({i, j + 1});
  if (a[i + 1][j + 1] == 1) v.push_back({i + 1, j + 1});
  for (auto x : v) {
    ans[res].push_back(x.first);
    ans[res].push_back(x.second);
  }
  res++;
}
void op2(long long int i, long long int j) {
  vector<pair<long long int, long long int>> v1, v2;
  if (a[i][j] == 1) v1.push_back({i, j});
  if (a[i + 1][j] == 1) v1.push_back({i + 1, j});
  if (a[i][j + 1] == 1) v1.push_back({i, j + 1});
  if (a[i + 1][j + 1] == 1) v1.push_back({i + 1, j + 1});
  if (a[i][j] == 0) v2.push_back({i, j});
  if (a[i + 1][j] == 0) v2.push_back({i + 1, j});
  if (a[i][j + 1] == 0) v2.push_back({i, j + 1});
  if (a[i + 1][j + 1] == 0) v2.push_back({i + 1, j + 1});
  for (auto x : v2) {
    ans[res].push_back(x.first);
    ans[res].push_back(x.second);
  }
  ans[res].push_back(v1[0].first);
  ans[res].push_back(v1[0].second);
  res++;
  for (auto x : v2) {
    ans[res].push_back(x.first);
    ans[res].push_back(x.second);
  }
  ans[res].push_back(v1[1].first);
  ans[res].push_back(v1[1].second);
  res++;
}
void op1(long long int i, long long int j) {
  vector<pair<long long int, long long int>> v1, v2;
  if (a[i][j] == 1) v1.push_back({i, j});
  if (a[i + 1][j] == 1) v1.push_back({i + 1, j});
  if (a[i][j + 1] == 1) v1.push_back({i, j + 1});
  if (a[i + 1][j + 1] == 1) v1.push_back({i + 1, j + 1});
  if (a[i][j] == 0) v2.push_back({i, j});
  if (a[i + 1][j] == 0) v2.push_back({i + 1, j});
  if (a[i][j + 1] == 0) v2.push_back({i, j + 1});
  if (a[i + 1][j + 1] == 0) v2.push_back({i + 1, j + 1});
  ans[res].push_back(v2[0].first);
  ans[res].push_back(v2[0].second);
  ans[res].push_back(v2[1].first);
  ans[res].push_back(v2[1].second);
  ans[res].push_back(v1[0].first);
  ans[res].push_back(v1[0].second);
  res++;
  ans[res].push_back(v1[0].first);
  ans[res].push_back(v1[0].second);
  ans[res].push_back(v2[2].first);
  ans[res].push_back(v2[2].second);
  ans[res].push_back(v2[0].first);
  ans[res].push_back(v2[0].second);
  res++;
  ans[res].push_back(v1[0].first);
  ans[res].push_back(v1[0].second);
  ans[res].push_back(v2[2].first);
  ans[res].push_back(v2[2].second);
  ans[res].push_back(v2[1].first);
  ans[res].push_back(v2[1].second);
  res++;
}
void op4(long long int i, long long int j) {
  vector<pair<long long int, long long int>> v;
  if (a[i][j] == 1) v.push_back({i, j});
  if (a[i + 1][j] == 1) v.push_back({i + 1, j});
  if (a[i][j + 1] == 1) v.push_back({i, j + 1});
  if (a[i + 1][j + 1] == 1) v.push_back({i + 1, j + 1});
  ans[res].push_back(v[0].first);
  ans[res].push_back(v[0].second);
  ans[res].push_back(v[1].first);
  ans[res].push_back(v[1].second);
  ans[res].push_back(v[2].first);
  ans[res].push_back(v[2].second);
  res++;
  a[i][j] = 0;
  a[i + 1][j] = 0;
  a[i][j + 1] = 0;
  op1(i, j);
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long int tcase;
  cin >> tcase;
  for (long long int tc = 1; tc <= tcase; tc++) {
    res = 0;
    long long int n, m;
    cin >> n >> m;
    string s[n];
    for (long long int i = 0; i < n; i++) cin >> s[i];
    for (long long int i = 0; i < n; i++)
      for (long long int j = 0; j < m; j++) a[i][j] = s[i][j] - '0';
    for (long long int j = m - 1; j > 1; --j) {
      for (long long int i = 0; i < n; i++) {
        if (a[i][j] == 0) continue;
        if (i != n - 1) {
          ans[res++] = {i, j, i, j - 1, i + 1, j - 1};
          a[i][j] = 0, a[i][j - 1] = 1 - a[i][j - 1],
          a[i + 1][j - 1] = 1 - a[i + 1][j - 1];
        } else {
          ans[res++] = {i, j, i, j - 1, i - 1, j - 1};
          a[i][j] = 0, a[i][j - 1] = 1 - a[i][j - 1],
          a[i - 1][j - 1] = 1 - a[i - 1][j - 1];
        }
      }
    }
    if (n % 2 == 0) {
      for (long long int i = 0; i < n; i += 2) {
        long long int cnt = 0;
        for (long long int x = i; x < i + 2; x++)
          for (long long int y = 0; y < 2; y++)
            if (a[x][y] == 1) ++cnt;
        if (cnt == 0)
          continue;
        else if (cnt == 1)
          op1(i, 0);
        else if (cnt == 2)
          op2(i, 0);
        else if (cnt == 3)
          op3(i, 0);
        else
          op4(i, 0);
        for (long long int x = i; x < i + 2; x++)
          for (long long int y = 0; y < 2; y++) a[x][y] = 0;
      }
    } else {
      if (a[n - 1][0] == 1 && a[n - 1][1] == 1) {
        ans[res++] = {n - 1, 0, n - 1, 1, n - 2, 0};
        a[n - 1][0] = a[n - 1][1] = 0;
        a[n - 2][0] = 1 - a[n - 2][0];
      }
      if (a[n - 1][0] == 1 && a[n - 1][1] == 0) {
        ans[res++] = {n - 1, 0, n - 2, 1, n - 2, 0};
        a[n - 1][0] = 0;
        a[n - 2][0] = 1 - a[n - 2][0];
        a[n - 2][1] = 1 - a[n - 2][1];
      }
      if (a[n - 1][0] == 0 && a[n - 1][1] == 1) {
        ans[res++] = {n - 1, 1, n - 2, 1, n - 2, 0};
        a[n - 1][1] = 0;
        a[n - 2][0] = 1 - a[n - 2][0];
        a[n - 2][1] = 1 - a[n - 2][1];
      }
      for (long long int i = 0; i < n - 1; i += 2) {
        long long int cnt = 0;
        for (long long int x = i; x < i + 2; x++)
          for (long long int y = 0; y < 2; y++)
            if (a[x][y] == 1) ++cnt;
        if (cnt == 0)
          continue;
        else if (cnt == 1)
          op1(i, 0);
        else if (cnt == 2)
          op2(i, 0);
        else if (cnt == 3)
          op3(i, 0);
        else
          op4(i, 0);
        for (long long int x = i; x < i + 2; x++)
          for (long long int y = 0; y < 2; y++) a[x][y] = 0;
      }
    }
    cout << res << '\n';
    for (long long int i = 0; i < res; i++) {
      for (long long int x : ans[i]) cout << x + 1 << ' ';
      cout << '\n';
    }
    for (long long int i = 0; i < res; i++) ans[i].clear();
  }
  return 0;
}
