#include <bits/stdc++.h>
using namespace std;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  err(++it, args...);
}
long long powMod(long long x, long long y) {
  long long p = 1;
  while (y) {
    if (y % 2) {
      p = (p * x) % ((long long)1e9 + 7);
    }
    y /= 2;
    x = (x * x) % ((long long)1e9 + 7);
  }
  return p;
}
long long CpowMod(long long x, long long y, long long w) {
  long long p = 1;
  while (y) {
    if (y % 2) {
      p = (p * x) % w;
    }
    y /= 2;
    x = (x * x) % w;
  }
  return p;
}
long long invMod(long long x) { return powMod(x, ((long long)1e9 + 7) - 2); }
long long CinvMod(long long x, long long w) { return CpowMod(x, w - 2, w); }
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
void solve() {
  long long T;
  cin >> T;
  while (T--) {
    long long n, m;
    cin >> n >> m;
    string s[n];
    for (long long i = 0; i <= n - 1; i++) {
      cin >> s[i];
    }
    string cust[4] = {"1110", "1101", "1011", "0111"};
    vector<pair<long long, long long>> pp;
    for (long long i = 0; i <= n - 2; i++) {
      for (long long j = 0; j <= m - 2; j++) {
        vector<pair<char, pair<long long, long long>>> v(4);
        for (long long ii = i; ii <= i + 1; ii++) {
          for (long long jj = j; jj <= j + 1; jj++) {
            v[(ii - i) * 2 + jj - j] = {s[ii][jj], {ii + 1, jj + 1}};
            s[ii][jj] = '0';
          }
        }
        sort(v.begin(), v.end(),
             greater<pair<char, pair<long long, long long>>>());
        string tmp;
        for (long long kk = 0; kk <= 3; kk++) tmp += v[kk].first;
        vector<long long> ans;
        if (tmp == "1111") {
          ans = {0, 1, 2, 3};
        } else if (tmp == "1110") {
          ans = {0};
        } else if (tmp == "1100") {
          ans = {2, 3};
        } else if (tmp == "1000") {
          ans = {0, 1, 2};
        }
        for (auto &it : ans) {
          long long kkk = 0;
          for (auto &is : cust[it]) {
            if (is == '1') {
              pp.push_back(v[kkk].second);
            }
            kkk++;
          }
        }
      }
    }
    cout << (long long)pp.size() / 3 << endl;
    long long itr = 1;
    for (auto &it : pp) {
      cout << it.first << " " << it.second << " ";
      if (itr % 3 == 0) cout << endl;
      itr++;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout.precision(20);
  solve();
  return 0;
}
