#include <bits/stdc++.h>
using namespace std;
struct _ {
  ios_base::Init i;
  _() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); }
} _;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  template <class c>
  debug& operator<<(const c&) {
    return *this;
  }
};
int main() {
  vector<pair<int, int>> parent(16);
  {
    vector<int> dist(16, INT_MAX);
    dist[0] = 0;
    queue<int> q;
    q.push(0);
    while (!q.empty()) {
      int par = q.front();
      q.pop();
      for (auto i : {7, 14, 13, 11}) {
        int child = par ^ i;
        if (dist[child] == INT_MAX) {
          dist[child] = dist[par] + 1;
          parent[child] = {par, i};
          q.push(child);
        }
      }
    }
  }
  int test;
  cin >> test;
  for (int tst = 1; tst <= test; ++tst) {
    int n, m;
    cin >> n >> m;
    vector<string> v(n);
    for (int i = 0; i <= n - 1; i++) cin >> v[i];
    vector<vector<int>> ans;
    auto mask = [&](int x, int y) -> int {
      int res = 0;
      if (v[x][y] == '1') res |= (8);
      if (v[x][y + 1] == '1') res |= (4);
      if (v[x + 1][y] == '1') res |= (2);
      if (v[x + 1][y + 1] == '1') res |= 1;
      return res;
    };
    auto flip = [&](int x, int y) -> void {
      v[x][y] = (v[x][y] == '1') ? '0' : '1';
    };
    auto coor = [&](int x, int y, int type) -> vector<int> {
      vector<int> res;
      if (type & (8)) res.push_back(x), res.push_back(y), flip(x, y);
      if (type & (4)) res.push_back(x), res.push_back(y + 1), flip(x, y + 1);
      if (type & (2)) res.push_back(x + 1), res.push_back(y), flip(x + 1, y);
      if (type & (1))
        res.push_back(x + 1), res.push_back(y + 1), flip(x + 1, y + 1);
      return res;
    };
    auto oper = [&](int x, int y) -> void {
      int curr = mask(x, y);
      debug() << " ["
              << "x"
                 ": "
              << (x)
              << "] "
                 " ["
              << "y"
                 ": "
              << (y)
              << "] "
                 " ["
              << "curr"
                 ": "
              << (curr) << "] ";
      while (curr != 0) {
        ans.push_back(coor(x, y, parent[curr].second));
        curr = parent[curr].first;
      }
    };
    for (int i = 0; i <= n - 2; i++)
      for (int j = 0; j <= m - 2; j++) oper(i, j);
    assert(ans.size() <= 3 * n * m);
    cout << ans.size() << "\n";
    for (auto i : ans) {
      for (auto j : i) cout << j + 1 << " ";
      cout << "\n";
    }
  }
  return 0;
}
