#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, m;
  cin >> n >> m;
  string second[n], d[n];
  for (long long i = 0; i < n; i++) cin >> second[i], d[i] = second[i];
  vector<vector<long long>> ans;
  for (long long i = 0; i < n; i += 2) {
    if (i == n - 1 && (n & 1)) i--;
    for (long long j = 0; j < m; j += 2) {
      if (j == m - 1 && (m & 1)) j--;
      long long fucki = i, fuckj = j;
      char a[2][2];
      a[0][0] = second[i][j];
      second[i][j] = '0';
      a[0][1] = second[i][j + 1];
      second[i][j + 1] = '0';
      a[1][0] = second[i + 1][j];
      second[i + 1][j] = '0';
      a[1][1] = second[i + 1][j + 1];
      second[i + 1][j + 1] = '0';
      vector<pair<long long, long long>> v;
      for (long long i = 0; i < 2; i++) {
        for (long long j = 0; j < 2; j++) {
          if (a[i][j] == '1') v.push_back({i, j});
        }
      }
      if (((long long)v.size()) == 0) continue;
      vector<long long> T;
      if (((long long)v.size()) == 3) {
        for (auto &el : v) {
          T.push_back(el.first);
          T.push_back(el.second);
        }
        for (long long i = 0; i < ((long long)T.size()); i++) {
          if (i & 1)
            T[i] += fuckj;
          else
            T[i] += fucki;
        }
        ans.push_back(T);
        continue;
      }
      if (((long long)v.size()) == 2) {
        auto [l, r] = v[0];
        auto [p, q] = v[1];
        vector<long long> c;
        for (long long i = 0; i < 2; i++) {
          for (long long j = 0; j < 2; j++) {
            if (a[i][j] == '0') {
              T.push_back(i);
              T.push_back(j);
              c.push_back(i);
              c.push_back(j);
            }
          }
        }
        T.push_back(l);
        T.push_back(r);
        for (long long i = 0; i < ((long long)T.size()); i++) {
          if (i & 1)
            T[i] += fuckj;
          else
            T[i] += fucki;
        }
        ans.push_back(T);
        T.clear();
        T.push_back(p);
        T.push_back(q);
        for (auto &el : c) T.push_back(el);
        for (long long i = 0; i < ((long long)T.size()); i++) {
          if (i & 1)
            T[i] += fuckj;
          else
            T[i] += fucki;
        }
        ans.push_back(T);
        continue;
      }
      if (((long long)v.size()) == 1) {
        auto [l, r] = v[0];
        T.push_back(l);
        T.push_back(r);
        vector<long long> c;
        long long u = 2;
        for (long long i = 0; i < 2 && u; i++) {
          for (long long j = 0; j < 2 && u; j++) {
            if (a[i][j] == '0') {
              T.push_back(i);
              T.push_back(j);
              c.push_back(i);
              c.push_back(j);
              u--;
              a[i][j] = '1';
              if (u == 0) break;
            }
          }
          if (u == 0) break;
        }
        a[l][r] = '0';
        for (long long i = 0; i < ((long long)T.size()); i++) {
          if (i & 1)
            T[i] += fuckj;
          else
            T[i] += fucki;
        }
        ans.push_back(T);
        T.clear();
        l = c[0], r = c[1];
        long long p = c[2], q = c[3];
        c.clear();
        for (long long i = 0; i < 2; i++) {
          for (long long j = 0; j < 2; j++) {
            if (a[i][j] == '0') {
              T.push_back(i);
              T.push_back(j);
              c.push_back(i);
              c.push_back(j);
            }
          }
        }
        T.push_back(l);
        T.push_back(r);
        for (long long i = 0; i < ((long long)T.size()); i++) {
          if (i & 1)
            T[i] += fuckj;
          else
            T[i] += fucki;
        }
        ans.push_back(T);
        T.clear();
        T.push_back(p);
        T.push_back(q);
        for (auto &el : c) T.push_back(el);
        for (long long i = 0; i < ((long long)T.size()); i++) {
          if (i & 1)
            T[i] += fuckj;
          else
            T[i] += fucki;
        }
        ans.push_back(T);
        continue;
      }
      T.push_back(0);
      T.push_back(0);
      a[0][0] = a[1][0] = a[1][1] = '0';
      T.push_back(1);
      T.push_back(0);
      T.push_back(1);
      T.push_back(1);
      for (long long i = 0; i < ((long long)T.size()); i++) {
        if (i & 1)
          T[i] += fuckj;
        else
          T[i] += fucki;
      }
      ans.push_back(T);
      T.clear();
      long long l = 0, r = 1;
      T.push_back(l);
      T.push_back(r);
      vector<long long> c;
      long long u = 2;
      for (long long i = 0; i < 2 && u; i++) {
        for (long long j = 0; j < 2 && u; j++) {
          if (a[i][j] == '0') {
            T.push_back(i);
            T.push_back(j);
            c.push_back(i);
            c.push_back(j);
            u--;
            a[i][j] = '1';
            if (u == 0) break;
          }
        }
        if (u == 0) break;
      }
      a[l][r] = '0';
      for (long long i = 0; i < ((long long)T.size()); i++) {
        if (i & 1)
          T[i] += fuckj;
        else
          T[i] += fucki;
      }
      ans.push_back(T);
      T.clear();
      l = c[0], r = c[1];
      long long p = c[2], q = c[3];
      c.clear();
      for (long long i = 0; i < 2; i++) {
        for (long long j = 0; j < 2; j++) {
          if (a[i][j] == '0') {
            T.push_back(i);
            T.push_back(j);
            c.push_back(i);
            c.push_back(j);
          }
        }
      }
      T.push_back(l);
      T.push_back(r);
      for (long long i = 0; i < ((long long)T.size()); i++) {
        if (i & 1)
          T[i] += fuckj;
        else
          T[i] += fucki;
      }
      ans.push_back(T);
      T.clear();
      T.push_back(p);
      T.push_back(q);
      for (auto &el : c) T.push_back(el);
      for (long long i = 0; i < ((long long)T.size()); i++) {
        if (i & 1)
          T[i] += fuckj;
        else
          T[i] += fucki;
      }
      ans.push_back(T);
    }
  }
  cout << ((long long)ans.size());
  cout << '\n';
  for (auto &el : ans) {
    for (auto &y : el) cout << y + 1 << ' ';
    cout << '\n';
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long _ = 1;
  cin >> _;
  for (long long i = 1; i <= _; i++) {
    solve();
  }
  return 0;
}
