#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int INF = 1e9;
long long add(long long a, long long b) {
  long long res = a + b;
  if (res >= mod) res -= mod;
  return res;
}
long long sub(long long a, long long b) {
  long long res = a - b + mod;
  if (res >= mod) res -= mod;
  return res;
}
long long mul(long long a, long long b) {
  return (((a % mod) * (b % mod)) % mod);
}
long long potolok(long long a, long long b) { return (a + b - 1) / b; }
long long gcd(long long x, long long y) {
  if (y == 0) {
    return x;
  }
  if (x > y) {
    return gcd(y, x % y);
  } else {
    return gcd(x, y % x);
  }
}
void solve() {
  int n, m;
  cin >> n >> m;
  vector<vector<int>> v(n, vector<int>(m));
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    for (int j = 0; j < m; j++) {
      v[i][j] = (s[j] - '0');
    }
  }
  vector<pair<int, int>> ans;
  int res = 0;
  for (int i = 0; i < n - 1; i++) {
    for (int j = 0; j < m - 1; j++) {
      int a = v[i][j], b = v[i][j + 1], c = v[i + 1][j], d = v[i + 1][j + 1];
      pair<int, int> pa = {i + 1, j + 1};
      pair<int, int> pb = {i + 1, j + 2};
      pair<int, int> pc = {i + 2, j + 1};
      pair<int, int> pd = {i + 2, j + 2};
      if (a == 1 && b == 1 && c == 1 && d == 1) {
        res += 4;
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pc);
        ans.push_back(pd);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
      if (a == 1 && b == 0 && c == 0 && d == 0) {
        res += 5;
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pc);
        ans.push_back(pd);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
      if (a == 0 && b == 1 && c == 0 && d == 0) {
        res += 5;
        ans.push_back(pa);
        ans.push_back(pc);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pc);
        ans.push_back(pd);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
      if (a == 0 && b == 0 && c == 1 && d == 0) {
        res += 5;
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pc);
        ans.push_back(pd);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
      if (a == 0 && b == 0 && c == 0 && d == 1) {
        res += 5;
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pc);
        ans.push_back(pd);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
      if (a == 0 && b == 1 && c == 1 && d == 1) {
        res++;
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pd);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
      if (a == 1 && b == 0 && c == 1 && d == 1) {
        res++;
        ans.push_back(pa);
        ans.push_back(pc);
        ans.push_back(pd);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
      if (a == 1 && b == 1 && c == 0 && d == 1) {
        res++;
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pd);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
      if (a == 1 && b == 1 && c == 1 && d == 0) {
        res++;
        ans.push_back(pa);
        ans.push_back(pc);
        ans.push_back(pb);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
      if (a == 1 && b == 0 && c == 1 && d == 0) {
        res += 1;
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pd);
        res++;
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pd);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
      if (a == 0 && b == 1 && c == 0 && d == 1) {
        res++;
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pc);
        res++;
        ans.push_back(pa);
        ans.push_back(pc);
        ans.push_back(pd);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
      if (a == 1 && b == 0 && c == 0 && d == 1) {
        res++;
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pd);
        res += 5;
        ans.push_back(pa);
        ans.push_back(pc);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pc);
        ans.push_back(pd);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
      if (a == 0 && b == 1 && c == 1 && d == 0) {
        res++;
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pc);
        res += 5;
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pd);
        ans.push_back(pa);
        ans.push_back(pc);
        ans.push_back(pd);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
      if (a == 1 && b == 1 && c == 0 && d == 0) {
        res++;
        ans.push_back(pb);
        ans.push_back(pc);
        ans.push_back(pd);
        res++;
        ans.push_back(pa);
        ans.push_back(pc);
        ans.push_back(pd);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
      if (a == 0 && b == 0 && c == 1 && d == 1) {
        res++;
        ans.push_back(pb);
        ans.push_back(pa);
        ans.push_back(pc);
        res++;
        ans.push_back(pa);
        ans.push_back(pb);
        ans.push_back(pd);
        v[i][j] = 0, v[i + 1][j] = 0, v[i][j + 1] = 0, v[i + 1][j + 1] = 0;
      }
    }
  }
  cout << res << endl;
  int cnt = 0;
  for (auto i : ans) {
    cnt++;
    cout << i.first << " " << i.second << " ";
    if (cnt % 3 == 0) {
      cout << endl;
    }
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
