#include <bits/stdc++.h>
using namespace std;
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
  for (auto& it : v) is >> it;
  return is;
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
template <class T>
ostream& operator<<(ostream& os, vector<T> V) {
  os << "[ ";
  for (auto v : V) os << v << " ";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, set<T> second) {
  os << "{ ";
  for (auto s : second) os << s << " ";
  return os << "}";
}
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " |";
  __f(comma + 1, args...);
}
void solve() {
  long long n, m;
  cin >> n >> m;
  vector<vector<bool>> mat(n, vector<bool>(m));
  for (long long i = 0; i < n; ++i) {
    string str;
    cin >> str;
    for (long long j = 0; j < m; ++j) {
      mat[i][j] = (str[j] == '1');
    }
  }
  set<long long> sxs;
  for (long long i = 0; i + 1 < n; i += 2) {
    sxs.insert(i);
  }
  sxs.insert(n - 2);
  vector<pair<long long, long long>> p1, p2, p3;
  for (long long sx : sxs) {
    for (long long j = 0; j < m - 2; ++j) {
      if (mat[sx][j] == false and mat[sx + 1][j] == false)
        continue;
      else if (mat[sx][j] == true and mat[sx + 1][j] == false) {
        p1.push_back({sx, j});
        mat[sx][j] = !mat[sx][j];
        p2.push_back({sx, j + 1});
        mat[sx][j + 1] = !mat[sx][j + 1];
        p3.push_back({sx + 1, j + 1});
        mat[sx + 1][j + 1] = !mat[sx + 1][j + 1];
      } else if (mat[sx][j] == false and mat[sx + 1][j] == true) {
        p1.push_back({sx + 1, j});
        mat[sx + 1][j] = !mat[sx + 1][j];
        p2.push_back({sx, j + 1});
        mat[sx][j + 1] = !mat[sx][j + 1];
        p3.push_back({sx + 1, j + 1});
        mat[sx + 1][j + 1] = !mat[sx + 1][j + 1];
      } else {
        p1.push_back({sx, j});
        mat[sx][j] = !mat[sx][j];
        p2.push_back({sx + 1, j});
        mat[sx + 1][j] = !mat[sx + 1][j];
        p3.push_back({sx, j + 1});
        mat[sx][j + 1] = !mat[sx][j + 1];
      }
    }
  }
  for (long long sx = 0; sx + 1 < n; ++sx) {
    long long j = m - 2;
    if (mat[sx][j] == false and mat[sx][j + 1] == false)
      continue;
    else if (mat[sx][j] == true and mat[sx][j + 1] == false) {
      p1.push_back({sx, j});
      mat[sx][j] = !mat[sx][j];
      p2.push_back({sx + 1, j});
      mat[sx + 1][j] = !mat[sx + 1][j];
      p3.push_back({sx + 1, j + 1});
      mat[sx + 1][j + 1] = !mat[sx + 1][j + 1];
    } else if (mat[sx][j] == false and mat[sx][j + 1] == true) {
      p1.push_back({sx, j + 1});
      mat[sx][j + 1] = !mat[sx][j + 1];
      p2.push_back({sx + 1, j});
      mat[sx + 1][j] = !mat[sx + 1][j];
      p3.push_back({sx + 1, j + 1});
      mat[sx + 1][j + 1] = !mat[sx + 1][j + 1];
    } else {
      p1.push_back({sx, j});
      mat[sx][j] = !mat[sx][j];
      p2.push_back({sx, j + 1});
      mat[sx][j + 1] = !mat[sx][j + 1];
      p3.push_back({sx + 1, j + 1});
      mat[sx + 1][j + 1] = !mat[sx + 1][j + 1];
    }
  }
  if (mat[n - 1][m - 1] == true and mat[n - 1][m - 2] == false) {
    p1.push_back({n - 1, m - 1});
    mat[n - 1][m - 1] = !mat[n - 1][m - 1];
    p2.push_back({n - 2, m - 2});
    mat[n - 2][m - 2] = !mat[n - 2][m - 2];
    p3.push_back({n - 2, m - 1});
    mat[n - 2][m - 1] = !mat[n - 2][m - 1];
  }
  if (mat[n - 1][m - 1] == false and mat[n - 1][m - 2] == true) {
    p1.push_back({n - 1, m - 2});
    mat[n - 1][m - 2] = !mat[n - 1][m - 2];
    p2.push_back({n - 2, m - 2});
    mat[n - 2][m - 2] = !mat[n - 2][m - 2];
    p3.push_back({n - 2, m - 1});
    mat[n - 2][m - 1] = !mat[n - 2][m - 1];
  }
  vector<pair<long long, long long>> eee = {
      {n - 2, m - 2}, {n - 2, m - 1}, {n - 1, m - 2}, {n - 1, m - 1}};
  vector<pair<long long, long long>> e1, e0;
  for (pair<long long, long long> p : eee) {
    if (mat[p.first][p.second]) {
      e1.push_back(p);
    } else {
      e0.push_back(p);
    }
  }
  if (e1.size()) {
    p1.push_back(e0[0]);
    mat[e0[0].first][e0[0].second] = !mat[e0[0].first][e0[0].second];
    p2.push_back(e0[1]);
    mat[e0[1].first][e0[1].second] = !mat[e0[1].first][e0[1].second];
    p3.push_back(e1[0]);
    mat[e1[0].first][e1[0].second] = !mat[e1[0].first][e1[0].second];
    p1.push_back(e0[0]);
    mat[e0[0].first][e0[0].second] = !mat[e0[0].first][e0[0].second];
    p2.push_back(e0[1]);
    mat[e0[1].first][e0[1].second] = !mat[e0[1].first][e0[1].second];
    p3.push_back(e1[1]);
    mat[e1[1].first][e1[1].second] = !mat[e1[1].first][e1[1].second];
  }
  cout << p1.size() << '\n';
  for (long long i = 0; i < p1.size(); ++i) {
    cout << p1[i].first + 1 << " " << p1[i].second + 1 << " ";
    cout << p2[i].first + 1 << " " << p2[i].second + 1 << " ";
    cout << p3[i].first + 1 << " " << p3[i].second + 1 << " ";
    cout << '\n';
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long T = 1;
  cin >> T;
  while (T--) {
    solve();
  }
  return 0;
}
