#include <bits/stdc++.h>
using namespace std;
string str[105];
class node {
 public:
  int a, b, c, d, e, f;
  node(int a1, int b1, int c1, int d1, int e1, int f1) {
    a = a1;
    b = b1;
    c = c1;
    d = d1;
    e = e1;
    f = f1;
  }
};
void flip(vector<int> ans) {
  for (int i = 0; i < 6; i += 2) {
    if (str[ans[i]][ans[i + 1]] == '1')
      str[ans[i]][ans[i + 1]] = '0';
    else
      str[ans[i]][ans[i + 1]] = '1';
  }
}
vector<node> moves;
void done3(int grid[], int x, int y) {
  vector<int> ans;
  for (int i = 0; i < 8; i += 2) {
    if (grid[i] != x || grid[i + 1] != y) {
      ans.push_back(grid[i]);
      ans.push_back(grid[i + 1]);
    }
  }
  node k(ans[0] + 1, ans[1] + 1, ans[2] + 1, ans[3] + 1, ans[4] + 1,
         ans[5] + 1);
  flip(ans);
  moves.push_back(k);
}
void done2(int grid[], int x, int y, int a, int b) {
  vector<int> ans;
  for (int i = 0; i < 8; i += 2) {
    if (grid[i] != a || grid[i + 1] != b) {
      ans.push_back(grid[i]);
      ans.push_back(grid[i + 1]);
    }
  }
  node k(ans[0] + 1, ans[1] + 1, ans[2] + 1, ans[3] + 1, ans[4] + 1,
         ans[5] + 1);
  moves.push_back(k);
  flip(ans);
  done3(grid, x, y);
}
void done1(int grid[], int x, int y) {
  vector<int> ans;
  ans.push_back(x);
  ans.push_back(y);
  int cnt = 0, i = 0;
  while (cnt != 2) {
    if (grid[i] != x || grid[i + 1] != y) {
      ans.push_back(grid[i]);
      ans.push_back(grid[i + 1]);
      cnt++;
    }
    i += 2;
  }
  node k(ans[0] + 1, ans[1] + 1, ans[2] + 1, ans[3] + 1, ans[4] + 1,
         ans[5] + 1);
  moves.push_back(k);
  flip(ans);
  done2(grid, ans[2], ans[3], ans[4], ans[5]);
}
void done4(int grid[]) {
  vector<int> ans;
  for (int i = 0; i < 6; i++) {
    ans.push_back(grid[i++]);
    ans.push_back(grid[i]);
  }
  node k(ans[0] + 1, ans[1] + 1, ans[2] + 1, ans[3] + 1, ans[4] + 1,
         ans[5] + 1);
  moves.push_back(k);
  flip(ans);
  done1(grid, grid[6], grid[7]);
}
void allDone(int i, int j) {
  vector<int> zero, one;
  if (str[i][j] == '0') {
    zero.push_back(i);
    zero.push_back(j);
  } else {
    one.push_back(i);
    one.push_back(j);
  }
  if (str[i][j + 1] == '0') {
    zero.push_back(i);
    zero.push_back(j + 1);
  } else {
    one.push_back(i);
    one.push_back(j + 1);
  }
  if (str[i + 1][j] == '0') {
    zero.push_back(i + 1);
    zero.push_back(j);
  } else {
    one.push_back(i + 1);
    one.push_back(j);
  }
  if (str[i + 1][j + 1] == '0') {
    zero.push_back(i + 1);
    zero.push_back(j + 1);
  } else {
    one.push_back(i + 1);
    one.push_back(j + 1);
  }
  int o = one.size() / 2;
  int grid[] = {i, j, i, j + 1, i + 1, j, i + 1, j + 1};
  if (o == 1) {
    done1(grid, one[0], one[1]);
  } else if (o == 2) {
    done2(grid, one[0], one[1], one[2], one[3]);
  } else if (o == 3) {
    done3(grid, zero[0], zero[1]);
  } else if (o == 4) {
    done4(grid);
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> str[i];
    for (int i = 0; i < n - 1; i += 2) {
      for (int j = 0; j < m - 1; j += 2) {
        allDone(i, j);
      }
    }
    if (n % 2) {
      int i = n - 2;
      for (int j = 0; j < m - 1; j += 2) {
        allDone(i, j);
      }
    }
    if (m % 2) {
      int j = m - 2;
      for (int i = 0; i < n - 1; i += 2) {
        allDone(i, j);
      }
    }
    if ((m % 2) && (n % 2)) {
      allDone(n - 2, m - 2);
    }
    int cnt = moves.size();
    cout << moves.size() << endl;
    for (int i = 0; i < cnt; i++) {
      cout << moves[i].a << " " << moves[i].b << " " << moves[i].c << " "
           << moves[i].d << " " << moves[i].e << " " << moves[i].f << endl;
    }
    for (int i = 0; i < n; i++) str[i].clear();
    moves.clear();
  }
  return 0;
}
