#include <bits/stdc++.h>
using namespace std;
char c[110][110];
vector<vector<pair<long long, long long>>> res;
vector<pair<long long, long long>> typ(long long a, long long b, long long ty) {
  vector<pair<long long, long long>> res;
  if (ty != 0) res.push_back({a, b});
  if (ty != 1) res.push_back({a, b + 1});
  if (ty != 2) res.push_back({a + 1, b});
  if (ty != 3) res.push_back({a + 1, b + 1});
  return res;
}
void ap(vector<pair<long long, long long>> v) {
  for (auto i : v) c[i.first][i.second] = c[i.first][i.second] ^ '0' ^ '1';
}
void solve(long long a, long long b) {
  long long tot = 0;
  pair<long long, long long> pos = {-1, -1};
  for (int i = 0, ggdem = 2; i < ggdem; ++i) {
    for (int j = 0, ggdem = 2; j < ggdem; ++j) {
      tot += (c[a + i][b + j] - '0');
      if (c[a + i][b + j] == '1') {
        pos = {a + i, b + j};
      }
    }
  }
  if (tot == 0) return;
  if (tot == 1) {
    for (int i = 0, ggdem = 2; i < ggdem; ++i) {
      for (int j = 0, ggdem = 2; j < ggdem; ++j) {
        if (pos != pair<long long, long long>({a + i, b + j})) {
          auto vv = typ(a, b, 2 * i + j);
          ap(vv);
          res.push_back(vv);
        }
      }
    }
    return;
  }
  if (tot == 2) {
    auto vv = typ(a, b, 0);
    ap(vv);
    res.push_back(vv);
    solve(a, b);
    return;
  }
  if (tot == 3) {
    for (int i = 0, ggdem = 2; i < ggdem; ++i) {
      for (int j = 0, ggdem = 2; j < ggdem; ++j) {
        if (c[a + i][b + j] == '0') {
          auto vv = typ(a, b, 2 * i + j);
          ap(vv);
          res.push_back(vv);
          return;
        }
      }
    }
    return;
  }
  if (tot == 4) {
    for (int i = 0, ggdem = 2; i < ggdem; ++i) {
      for (int j = 0, ggdem = 2; j < ggdem; ++j) {
        auto vv = typ(a, b, 2 * i + j);
        ap(vv);
        res.push_back(vv);
      }
    }
    return;
  }
}
void print(long long n, long long m) {
  for (int i = 0, ggdem = n; i < ggdem; ++i) {
    for (int j = 0, ggdem = m; j < ggdem; ++j) {
      cout << c[i][j] << " ";
    }
    cout << "\n";
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    res.clear();
    long long n, m;
    cin >> n >> m;
    for (int i = 0, ggdem = n; i < ggdem; ++i) {
      for (int j = 0, ggdem = m; j < ggdem; ++j) {
        cin >> c[i][j];
      }
    }
    for (int i = 0, ggdem = n / 2; i < ggdem; ++i) {
      for (int j = 0, ggdem = m / 2; j < ggdem; ++j) {
        solve(2 * i, 2 * j);
      }
    }
    if (n & 1) {
      for (int j = 0, ggdem = m / 2; j < ggdem; ++j) {
        solve(2 * (n / 2) - 1, 2 * j);
      }
    }
    if (m & 1) {
      for (int i = 0, ggdem = n / 2; i < ggdem; ++i) {
        solve(2 * i, 2 * (m / 2) - 1);
      }
    }
    if ((m & 1) && (n & 1)) {
      solve(2 * (n / 2) - 1, 2 * (m / 2) - 1);
    }
    cout << ((int)res.size()) << "\n";
    for (auto i : res) {
      for (auto j : i) cout << j.first + 1 << " " << j.second + 1 << " ";
      cout << "\n";
    }
  }
  return 0;
}
