#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " = " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " = " << arg1 << " || ";
  __f(comma + 1, args...);
}
template <class Ch, class Tr, class Container>
basic_ostream<Ch, Tr>& operator<<(basic_ostream<Ch, Tr>& os,
                                  Container const& x) {
  os << "{ ";
  for (auto& y : x) os << y << " ; ";
  return os << "}";
}
template <class X, class Y>
ostream& operator<<(ostream& os, pair<X, Y> const& p) {
  return os << "[ " << p.first << ", " << p.second << "]";
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long arr[200][200];
vector<vector<pair<long long, long long>>> ops;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    long long n, m;
    cin >> n >> m;
    string temp;
    ops.clear();
    for (long long i = 0; i < n; i++) {
      cin >> temp;
      for (long long j = 0; j < m; j++) {
        arr[i][j] = temp[j] - '0';
      }
    }
    pair<long long, long long> st = {0, 0};
    long long c = 0;
    long long f = 0;
    while (c < (n - 1) * (m - 1) - 1) {
      long long tc = 0;
      vector<pair<long long, long long>> req;
      if ((c + 1) % (m - 1) == 0) {
        if (arr[st.first][st.second] == 1) {
          req.push_back(st);
        }
        if (arr[st.first][st.second + 1] == 1) {
          req.push_back({st.first, st.second + 1});
        }
        if ((long long)(req.size()) == 1) {
          req.push_back({st.first + 1, st.second});
          req.push_back({st.first + 1, st.second + 1});
        } else if ((long long)(req.size()) == 2) {
          req.push_back({st.first + 1, st.second});
        }
        for (auto it : req) {
          arr[it.first][it.second] ^= 1;
        }
        st.first++;
        f ^= 1;
      } else {
        if (f == 0) {
          if (arr[st.first][st.second] == 1) {
            req.push_back(st);
          }
          if (arr[st.first + 1][st.second] == 1) {
            req.push_back({st.first + 1, st.second});
          }
          if ((long long)(req.size()) == 1) {
            req.push_back({st.first, st.second + 1});
            req.push_back({st.first + 1, st.second + 1});
          } else if ((long long)(req.size()) == 2) {
            req.push_back({st.first, st.second + 1});
          }
          for (auto it : req) {
            arr[it.first][it.second] ^= 1;
          }
        } else {
          if (arr[st.first][st.second + 1] == 1) {
            req.push_back({st.first, st.second + 1});
          }
          if (arr[st.first + 1][st.second + 1] == 1) {
            req.push_back({st.first + 1, st.second + 1});
          }
          if ((long long)(req.size()) == 1) {
            req.push_back({st.first, st.second});
            req.push_back({st.first + 1, st.second});
          } else if ((long long)(req.size()) == 2) {
            req.push_back({st.first + 1, st.second});
          }
          for (auto it : req) {
            arr[it.first][it.second] ^= 1;
          }
        }
        if (f == 0)
          st.second++;
        else
          st.second--;
      }
      if ((long long)(req.size()) > 0) {
        ops.push_back(req);
      }
      c++;
    }
    while (1) {
      vector<pair<long long, long long>> req;
      if (arr[st.first][st.second] == 1) req.push_back(st);
      if (arr[st.first + 1][st.second] == 1)
        req.push_back({st.first + 1, st.second});
      if (arr[st.first][st.second + 1] == 1)
        req.push_back({st.first, st.second + 1});
      if (arr[st.first + 1][st.second + 1] == 1)
        req.push_back({st.first + 1, st.second + 1});
      if ((long long)(req.size()) == 0) break;
      if ((long long)(req.size()) == 4 || (long long)(req.size()) == 2)
        req.pop_back();
      else if ((long long)(req.size()) == 3) {
        ops.push_back(req);
        for (auto it : req) arr[it.first][it.second] ^= 1;
        break;
      }
      for (long long i = 0; i < 2; i++) {
        for (long long j = 0; j < 2; j++) {
          if ((long long)(req.size()) == 3) break;
          if (arr[st.first + i][st.second + j] == 0) {
            req.push_back({st.first + i, st.second + j});
          }
        }
      }
      for (auto it : req) arr[it.first][it.second] ^= 1;
      ops.push_back(req);
    }
    cout << (long long)(ops.size()) << '\n';
    for (auto it : ops) {
      long long c = 0;
      for (auto it2 : it) {
        if (c != 0) {
          cout << ' ';
        }
        cout << it2.first + 1 << ' ' << it2.second + 1;
        c++;
      }
      cout << '\n';
    }
  }
  return 0;
}
