#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const double PI = acos(-1);
long long gcd() { return 0ll; }
template <typename T, typename... Args>
T gcd(T a, Args... args) {
  return __gcd(a, (__typeof(a))gcd(args...));
}
const int N = 1e5 + 2;
vector<string> s;
vector<vector<pair<int, int>>> ans;
void fix(vector<pair<int, int>> &x) {
  for (auto &[i, j] : x) s[i][j] = '0' + !(s[i][j] - '0');
}
void solve3(int i1, int j1) {
  vector<pair<int, int>> x;
  for (int i = i1; i < i1 + 2; i++)
    for (int j = j1; j < j1 + 2; j++)
      if (s[i][j] == '1') x.emplace_back(i, j);
  fix(x);
  ans.emplace_back(x);
}
void solve2(int i1, int j1) {
  vector<pair<int, int>> x;
  bool f = 0;
  for (int i = i1; i < i1 + 2; i++)
    for (int j = j1; j < j1 + 2; j++) {
      if (f == 0 && s[i][j] == '1') {
        x.emplace_back(i, j);
        f = 1;
      }
      if (s[i][j] == '0') x.emplace_back(i, j);
    }
  fix(x);
  ans.emplace_back(x);
  solve3(i1, j1);
}
void solve1(int i1, int j1) {
  vector<pair<int, int>> x;
  int f = 0;
  for (int i = i1; i < i1 + 2; i++)
    for (int j = j1; j < j1 + 2; j++) {
      if (f < 2 && s[i][j] == '0') {
        x.emplace_back(i, j);
        f++;
      }
      if (s[i][j] == '1') x.emplace_back(i, j);
    }
  fix(x);
  ans.emplace_back(x);
  solve2(i1, j1);
}
void solve4(int i1, int j1) {
  vector<pair<int, int>> x;
  x.emplace_back(i1, j1);
  x.emplace_back(i1 + 1, j1);
  x.emplace_back(i1, j1 + 1);
  fix(x);
  ans.emplace_back(x);
  solve1(i1, j1);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int T;
  cin >> T;
  while (T--) {
    ans.clear();
    int n, m;
    cin >> n >> m;
    s.resize(n);
    for (int i = 0; i < n; i++) cin >> s[i];
    vector<pair<int, int>> temp;
    if (m & 1) {
      for (int i = 0; i < n; i += 2) {
        if (i == n - 1) i--;
        temp.clear();
        if (s[i][0] == '1') temp.emplace_back(i, 0);
        if (s[i + 1][0] == '1') temp.emplace_back(i + 1, 0);
        if (temp.size() == 0) continue;
        temp.emplace_back(i, 1);
        if (temp.size() == 2) temp.emplace_back(i + 1, 1);
        fix(temp);
        ans.emplace_back(temp);
      }
    }
    if (n & 1) {
      for (int i = m & 1; i < m; i += 2) {
        if (i == m - 1) i--;
        temp.clear();
        if (s[0][i] == '1') temp.emplace_back(0, i);
        if (s[0][i + 1] == '1') temp.emplace_back(0, i + 1);
        if (temp.size() == 0) continue;
        temp.emplace_back(1, i);
        if (temp.size() == 2) temp.emplace_back(1, i + 1);
        fix(temp);
        ans.emplace_back(temp);
      }
    }
    for (int i = (n & 1); i < n; i += 2) {
      for (int j = (m & 1); j < m; j += 2) {
        int sum = 0;
        for (int i1 = i; i1 < i + 2; i1++)
          for (int j1 = j; j1 < j + 2; j1++) sum += s[i1][j1] == '1';
        if (sum == 1) solve1(i, j);
        if (sum == 2) solve2(i, j);
        if (sum == 3) solve3(i, j);
        if (sum == 4) solve4(i, j);
      }
    }
    cout << ans.size() << "\n";
    for (auto &it : ans) {
      for (auto &[i, j] : it) cout << i + 1 << " " << j + 1 << " ";
      cout << "\n";
    }
  }
  return 0;
}
