#include <bits/stdc++.h>
using namespace std;
const int MAXN = 101;
const long long INF = 1000000000ll;
const int MOD = 1000000007;
string s[MAXN];
vector<pair<int, int>> a;
int n, m;
void change(int x, int y) {
  if (s[x][y] == '0') {
    s[x][y] = '1';
  } else {
    s[x][y] = '0';
  }
}
bool go(int x, int y) {
  int cnt = 0;
  for (int i = 0; i < (int)(2); i++) {
    for (int j = 0; j < (int)(2); j++) {
      if (s[x + i][y + j] == '1') {
        cnt++;
      }
    }
  }
  if (cnt == 0) {
    return true;
  }
  if (cnt == 4) {
    a.push_back({x, y});
    change(x, y);
    a.push_back({x + 1, y});
    change(x + 1, y);
    a.push_back({x + 1, y + 1});
    change(x + 1, y + 1);
  }
  if (cnt == 3) {
    for (int i = 0; i < (int)(2); i++) {
      for (int j = 0; j < (int)(2); j++) {
        if (s[x + i][y + j] == '1') {
          change(x + i, y + j);
          a.push_back({x + i, y + j});
        }
      }
    }
    return true;
  }
  if (cnt == 2) {
    int k = 0;
    for (int i = 0; i < (int)(2); i++) {
      for (int j = 0; j < (int)(2); j++) {
        if (s[x + i][y + j] == '1' && k == 0) {
          change(x + i, y + j);
          a.push_back({x + i, y + j});
          k++;
        } else {
          if (s[x + i][y + j] == '0') {
            change(x + i, y + j);
            a.push_back({x + i, y + j});
          }
        }
      }
    }
  }
  if (cnt == 1) {
    int k = 0;
    for (int i = 0; i < (int)(2); i++) {
      for (int j = 0; j < (int)(2); j++) {
        if (s[x + i][y + j] == '0' && k <= 1) {
          change(x + i, y + j);
          a.push_back({x + i, y + j});
          k++;
        } else {
          if (s[x + i][y + j] == '1') {
            change(x + i, y + j);
            a.push_back({x + i, y + j});
          }
        }
      }
    }
  }
  return false;
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cout.precision(10);
  cout << fixed;
  int t;
  cin >> t;
  for (int tt = 0; tt < (int)(t); tt++) {
    cin >> n >> m;
    for (int i = 0; i < (int)(n); i++) {
      cin >> s[i];
    }
    a.clear();
    for (int i = 0; i < n; i += 2) {
      for (int j = 0; j < m; j += 2) {
        if (i == n - 1) {
          i--;
        }
        if (j == m - 1) {
          j--;
        }
        while (!go(i, j)) {
        }
      }
    }
    cout << a.size() / 3 << "\n";
    for (int i = 0; i < (int)(a.size() / 3); i++) {
      cout << a[3 * i].first + 1 << " " << a[3 * i].second + 1 << " "
           << a[3 * i + 1].first + 1 << " " << a[3 * i + 1].second + 1 << " "
           << a[3 * i + 2].first + 1 << " " << a[3 * i + 2].second + 1 << "\n";
    }
  }
  return 0;
}
