#include <bits/stdc++.h>
using namespace std;
inline void write(int x, char ss) {
  int zuida = 1000000000;
  while (zuida > x) zuida /= 10;
  char s;
  for (zuida; zuida >= 1; zuida /= 10) {
    s = '0' + x / zuida;
    x %= zuida;
    putchar(s);
  }
  putchar(ss);
  return;
}
const int maxn = 105;
int lzy;
int n, m;
bool shu[maxn][maxn];
int tot;
struct nod {
  int shu1, shu2, shu3, shu4, shu5, shu6;
  nod() {}
  nod(int a1, int a2, int a3, int a4, int a5, int a6) {
    shu1 = a1, shu2 = a2, shu3 = a3, shu4 = a4, shu5 = a5, shu6 = a6;
  }
} ans[maxn * maxn * 3];
inline void yi(int x, int y, bool shu1, bool shu2, bool shu3, bool shu4) {
  if (shu1) {
    ans[++tot] = nod(x, y, x + 1, y, x, y + 1);
    ans[++tot] = nod(x, y, x, y + 1, x + 1, y + 1);
    ans[++tot] = nod(x, y, x + 1, y, x + 1, y + 1);
  } else if (shu2) {
    ans[++tot] = nod(x, y, x + 1, y, x, y + 1);
    ans[++tot] = nod(x, y, x, y + 1, x + 1, y + 1);
    ans[++tot] = nod(x + 1, y, x, y + 1, x + 1, y + 1);
  } else if (shu3) {
    ans[++tot] = nod(x, y, x + 1, y, x, y + 1);
    ans[++tot] = nod(x + 1, y, x, y + 1, x + 1, y + 1);
    ans[++tot] = nod(x, y, x + 1, y, x + 1, y + 1);
  } else {
    ans[++tot] = nod(x + 1, y, x, y + 1, x + 1, y + 1);
    ans[++tot] = nod(x, y, x, y + 1, x + 1, y + 1);
    ans[++tot] = nod(x, y, x + 1, y, x + 1, y + 1);
  }
  return;
}
inline void san(int x, int y, bool shu1, bool shu2, bool shu3, bool shu4) {
  if (!shu1) ans[++tot] = nod(x + 1, y, x, y + 1, x + 1, y + 1);
  if (!shu2) ans[++tot] = nod(x + 1, y, x, y, x + 1, y + 1);
  if (!shu3) ans[++tot] = nod(x, y, x, y + 1, x + 1, y + 1);
  if (!shu4) ans[++tot] = nod(x, y, x, y + 1, x + 1, y);
  return;
}
inline void getans(int x, int y, bool shu1, bool shu2, bool shu3, bool shu4) {
  int jie = 0;
  jie += shu1, jie += shu2, jie += shu3, jie += shu4;
  if (!jie) return;
  if (jie == 1)
    yi(x, y, shu1, shu2, shu3, shu4);
  else if (jie == 2) {
    if (shu1 && shu2) {
      ans[++tot] = nod(x, y, x, y + 1, x + 1, y + 1);
      yi(x, y, false, false, false, true);
    } else if (shu1 && shu3) {
      ans[++tot] = nod(x, y, x + 1, y, x, y + 1);
      yi(x, y, false, true, false, false);
    } else if (shu2 && shu4) {
      ans[++tot] = nod(x, y, x, y + 1, x + 1, y + 1);
      yi(x, y, true, false, false, false);
    } else if (shu3 && shu4) {
      ans[++tot] = nod(x, y, x + 1, y, x + 1, y + 1);
      yi(x, y, true, false, false, false);
    } else if (shu1 && shu4) {
      ans[++tot] = nod(x, y, x + 1, y, x, y + 1);
      san(x, y, false, true, true, true);
    } else {
      ans[++tot] = nod(x, y, x + 1, y, x + 1, y + 1);
      san(x, y, true, true, false, true);
    }
  } else if (jie == 3)
    san(x, y, shu1, shu2, shu3, shu4);
  else {
    ans[++tot] = nod(x, y, x + 1, y, x, y + 1);
    yi(x, y, false, false, false, true);
  }
  return;
}
signed main() {
  cin >> lzy;
  while (lzy--) {
    cin >> n >> m;
    char s;
    memset(shu, false, sizeof(shu));
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= m; j++) {
        s = getchar();
        while (s != '1' && s != '0') s = getchar();
        if (s == '1') shu[i][j] = true;
      }
    tot = 0;
    for (int i = 1; i < n; i++)
      for (int j = 1; j < m; j++) {
        getans(i, j, shu[i][j], shu[i][j + 1], shu[i + 1][j],
               shu[i + 1][j + 1]);
        shu[i][j] = shu[i][j + 1] = shu[i + 1][j] = shu[i + 1][j + 1] = false;
      }
    cout << tot << "\n";
    for (int i = 1; i <= tot; i++) {
      write(ans[i].shu1, ' ');
      write(ans[i].shu2, ' ');
      write(ans[i].shu3, ' ');
      write(ans[i].shu4, ' ');
      write(ans[i].shu5, ' ');
      write(ans[i].shu6, ' ');
      cout << "\n";
    }
  }
}
