#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const long long int MAXN = 1e5 + 5;
const long long int mod = 1e9 + 7;
long long int it = 0, ans = 0;
template <typename temp>
void sp(temp x) {
  cout << x << " ";
}
template <typename temp>
void np(temp x) {
  cout << x << "\n";
}
template <typename Arg1, typename... Args>
void sp(Arg1 arg1, Args... args) {
  cout << arg1 << " ";
  sp(args...);
}
template <typename Arg1, typename... Args>
void np(Arg1 arg1, Args... args) {
  cout << arg1 << "\n";
  np(args...);
}
template <typename temp>
void spv(temp T, long long int n) {
  for (int i = 0; i < n; i++) sp(T[i]);
}
template <typename temp>
void npv(temp T, long long int n) {
  for (int i = 0; i < n; i++) np(T[i]);
}
template <typename T>
T modpow(T base, T exp, T modulus) {
  base %= modulus;
  T result = 1;
  while (exp > 0) {
    if (exp & 1) result = (result * base) % modulus;
    base = (base * base) % modulus;
    exp >>= 1;
  }
  return result;
}
template <typename T>
T modinv(T base, T exp) {
  return modpow(base, exp - 2, exp);
}
long long int spf[MAXN];
void sieve() {
  spf[1] = 1;
  for (auto i = 2; i < MAXN; i++) spf[i] = i;
  for (auto i = 4; i < MAXN; i += 2) spf[i] = 2;
  for (auto i = 3; i * i < MAXN; i++) {
    if (spf[i] == i) {
      for (auto j = i * i; j < MAXN; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
  return;
}
vector<long long int> getFactorization(long long int x) {
  vector<long long int> res;
  while (x != 1) {
    res.push_back(spf[x]);
    x = x / spf[x];
  }
  return res;
}
long long int poss00[2][2] = {{0, 0}, {0, 0}};
long long int poss01[2][2] = {{0, 0}, {0, 1}};
long long int poss02[2][2] = {{0, 1}, {0, 0}};
long long int poss03[2][2] = {{0, 0}, {1, 0}};
long long int poss04[2][2] = {{1, 0}, {0, 0}};
long long int poss05[2][2] = {{1, 1}, {0, 0}};
long long int poss06[2][2] = {{1, 0}, {0, 1}};
long long int poss07[2][2] = {{0, 0}, {1, 1}};
long long int poss08[2][2] = {{0, 1}, {1, 0}};
long long int poss09[2][2] = {{1, 1}, {1, 0}};
long long int poss10[2][2] = {{1, 1}, {0, 1}};
long long int poss11[2][2] = {{0, 1}, {1, 1}};
long long int poss12[2][2] = {{1, 0}, {1, 1}};
long long int poss13[2][2] = {{1, 1}, {1, 1}};
long long int poss14[2][2] = {{0, 0}, {1, 1}};
long long int poss15[2][2] = {{1, 1}, {0, 0}};
void check() {
  long long int n, m;
  cin >> n >> m;
  char p[n][m];
  ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> p[i][j];
      if (p[i][j] == '1') ans++;
    }
  }
  np(ans * 3);
  for (int i = 0; i < n - 1; i++) {
    for (int j = 0; j < m - 1; j++) {
      if (p[i][j] == '1') {
        cout << i + 1 << " " << j + 1 << " " << i + 2 << " " << j + 1 << " "
             << i + 1 << " " << j + 2 << endl;
        cout << i + 1 << " " << j + 1 << " " << i + 2 << " " << j + 1 << " "
             << i + 2 << " " << j + 2 << endl;
        cout << i + 1 << " " << j + 1 << " " << i + 2 << " " << j + 2 << " "
             << i + 1 << " " << j + 2 << endl;
      }
    }
  }
  for (int i = 1; i < n; i++) {
    if (p[i - 1][m - 1] == '1') {
      cout << i << " " << m << " " << i + 1 << " " << m << " " << i << " "
           << m - 1 << endl;
      cout << i << " " << m << " " << i + 1 << " " << m << " " << i + 1 << " "
           << m - 1 << endl;
      cout << i << " " << m << " " << i << " " << m - 1 << " " << i + 1 << " "
           << m - 1 << endl;
    }
  }
  for (int i = 1; i < m; i++) {
    if (p[n - 1][i - 1] == '1') {
      cout << n << " " << i << " " << n - 1 << " " << i << " " << n << " "
           << i + 1 << endl;
      cout << n << " " << i << " " << n - 1 << " " << i << " " << n - 1 << " "
           << i + 1 << endl;
      cout << n << " " << i << " " << n - 1 << " " << i + 1 << " " << n << " "
           << i + 1 << endl;
    }
  }
  if (p[n - 1][m - 1] == '1') {
    cout << n << " " << m << " " << n - 1 << " " << m << " " << n << " "
         << m - 1 << endl;
    cout << n << " " << m << " " << n - 1 << " " << m << " " << n - 1 << " "
         << m - 1 << endl;
    cout << n << " " << m << " " << n - 1 << " " << m - 1 << " " << n << " "
         << m - 1 << endl;
  }
  return;
}
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  ;
  long long int t = 1;
  cin >> t;
  while (t--) check();
  return 0;
}
