#include <bits/stdc++.h>
using namespace std;
const long long INF = 9223372036854775807;
const long long MOD = 1000000007;
const long double PI = acos(-1);
inline long long power(long long a, long long b, long long z = MOD) {
  long long res = 1;
  a = (a % z);
  while (b) {
    if (b & 1) res = (res * a) % z;
    a = (a * a) % z;
    b = b >> 1;
  }
  return res;
}
inline long long inverse(long long a, long long z = MOD) {
  return power(a, z - 2, z);
}
long long extend(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long x1, y1;
  long long g = extend(b, a % b, x1, y1);
  x = y1;
  y = x1 - (a / b) * y1;
  return g;
}
inline long long mat_power(long long a, long long b, long long c, long long d,
                           long long n, long long z = MOD) {
  long long a0 = 1, b0 = 0, c0 = 0, d0 = 1;
  while (n) {
    if (n & 1) {
      long long a1 = a0, b1 = b0, c1 = c0, d1 = d0;
      a0 = (a1 * a + b1 * c) % z;
      b0 = (a1 * b + b1 * d) % z;
      c0 = (c1 * a + d1 * c) % z;
      d0 = (c1 * b + d1 * d) % z;
    }
    long long a1 = a, b1 = b, c1 = c, d1 = d;
    a = (a1 * a1 + b1 * c1) % z;
    b = (a1 * b1 + b1 * d1) % z;
    c = (c1 * a1 + d1 * c1) % z;
    d = (c1 * b1 + d1 * d1) % z;
    n = n >> 1;
  }
  return c0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  for (int test = 1; test <= t; test++) {
    int n, m;
    cin >> n >> m;
    string aray[n];
    for (int i = 0; i < n; i++) cin >> aray[i];
    vector<vector<int> > ans;
    for (int i = 0; i < n - 1; i += 2) {
      for (int j = 0; j < m - 2; j++) {
        if (aray[i][j] == aray[i + 1][j]) {
          if (aray[i][j] == '1') {
            ans.push_back({i, j, i + 1, j, i, j + 1});
            aray[i][j] = aray[i + 1][j] = '0';
            aray[i][j + 1] = '1' - aray[i][j + 1] + '0';
          }
        } else {
          int x;
          if (aray[i][j] == '1')
            x = i;
          else
            x = i + 1;
          ans.push_back({x, j, i, j + 1, i + 1, j + 1});
          aray[x][j] = '0';
          aray[i][j + 1] = '1' - aray[i][j + 1] + '0';
          aray[i + 1][j + 1] = '1' - aray[i + 1][j + 1] + '0';
        }
      }
    }
    if (n & 1) {
      int i = n - 2;
      for (int j = 0; j < m - 2; j++) {
        if (aray[i][j] == aray[i + 1][j]) {
          if (aray[i][j] == '1') {
            ans.push_back({i, j, i + 1, j, i, j + 1});
            aray[i][j] = aray[i + 1][j] = '0';
            aray[i][j + 1] = '1' - aray[i][j + 1] + '0';
          }
        } else {
          int x;
          if (aray[i][j] == '1')
            x = i;
          else
            x = i + 1;
          ans.push_back({x, j, i, j + 1, i + 1, j + 1});
          aray[x][j] = '0';
          aray[i][j + 1] = '1' - aray[i][j + 1] + '0';
          aray[i + 1][j + 1] = '1' - aray[i + 1][j + 1] + '0';
        }
      }
    }
    for (int i = 0; i < n - 1; i++) {
      if (aray[i][m - 1] == aray[i][m - 2]) {
        if (aray[i][m - 1] == '1') {
          ans.push_back({i, m - 2, i, m - 1, i + 1, m - 2});
          aray[i][m - 1] = aray[i][m - 2] = '0';
          aray[i + 1][m - 2] = '1' - aray[i + 1][m - 2] + '0';
        }
      } else {
        int x;
        if (aray[i][m - 1] == '1')
          x = m - 1;
        else
          x = m - 2;
        ans.push_back({i, x, i + 1, m - 2, i + 1, m - 1});
        aray[i][x] = '0';
        aray[i + 1][m - 1] = '1' - aray[i + 1][m - 1] + '0';
        aray[i + 1][m - 2] = '1' - aray[i + 1][m - 2] + '0';
      }
    }
    if (aray[n - 1][m - 1] == '1' && aray[n - 1][m - 2] == '0') {
      int i = n - 1;
      ans.push_back({i, m - 1, i, m - 2, i - 1, m - 2});
      ans.push_back({i, m - 1, i - 1, m - 1, i, m - 2});
      ans.push_back({i, m - 1, i - 1, m - 1, i - 1, m - 2});
      aray[i][m - 1] = '0';
    }
    if (aray[n - 1][m - 1] == '1' && aray[n - 1][m - 2] == '1') {
      int i = n - 1;
      ans.push_back({i - 1, m - 1, i - 1, m - 2, i, m - 2});
      ans.push_back({i - 1, m - 1, i - 1, m - 2, i, m - 1});
      aray[i][m - 1] = aray[i][m - 2] = '0';
    }
    if (aray[n - 1][m - 2] == '1') {
      int i = n - 1;
      ans.push_back({i, m - 1, i, m - 2, i - 1, m - 1});
      ans.push_back({i, m - 2, i - 1, m - 2, i - 1, m - 1});
      ans.push_back({i, m - 2, i - 1, m - 2, i, m - 1});
      aray[i][m - 2] = '0';
    }
    cout << ans.size() << "\n";
    for (auto x : ans) {
      for (auto y : x) cout << y + 1 << " ";
      cout << "\n";
    }
  }
  return 0;
}
