Problem: This is the easy version of the problem. The difference between the versions is in the number of possible operations that can be made. You can make hacks if and only if you solved both versions of the problem.

You are given a binary table of size n × m. This table consists of symbols 0 and 1.

You can make such operation: select 3 different cells that belong to one 2 × 2 square and change the symbols in these cells (change 0 to 1 and 1 to 0).

Your task is to make all symbols in the table equal to 0. You are allowed to make at most 3nm operations. You don't need to minimize the number of operations.

It can be proved that it is always possible.

Input

The first line contains a single integer t (1 ≤ t ≤ 5000) — the number of test cases. The next lines contain descriptions of test cases.

The first line of the description of each test case contains two integers n, m (2 ≤ n, m ≤ 100).

Each of the next n lines contains a binary string of length m, describing the symbols of the next row of the table.

It is guaranteed that the sum of nm for all test cases does not exceed 20000.

Output

For each test case print the integer k (0 ≤ k ≤ 3nm) — the number of operations.

In the each of the next k lines print 6 integers x_1, y_1, x_2, y_2, x_3, y_3 (1 ≤ x_1, x_2, x_3 ≤ n, 1 ≤ y_1, y_2, y_3 ≤ m) describing the next operation. This operation will be made with three cells (x_1, y_1), (x_2, y_2), (x_3, y_3). These three cells should be different. These three cells should belong into some 2 × 2 square.

Example

Input


5
2 2
10
11
3 3
011
101
110
4 4
1111
0110
0110
1111
5 5
01011
11001
00010
11011
10000
2 3
011
101


Output


1
1 1 2 1 2 2
2 
2 1 3 1 3 2
1 2 1 3 2 3
4
1 1 1 2 2 2 
1 3 1 4 2 3
3 2 4 1 4 2
3 3 4 3 4 4
4
1 2 2 1 2 2 
1 4 1 5 2 5 
4 1 4 2 5 1
4 4 4 5 3 4
2
1 3 2 2 2 3
1 2 2 1 2 2

Note

In the first test case, it is possible to make only one operation with cells (1, 1), (2, 1), (2, 2). After that, all symbols will be equal to 0.

In the second test case:

  * operation with cells (2, 1), (3, 1), (3, 2). After it the table will be: 
    
          
    011  
    001  
    000  
    

  * operation with cells (1, 2), (1, 3), (2, 3). After it the table will be: 
    
          
    000  
    000  
    000  
    




In the fifth test case:

  * operation with cells (1, 3), (2, 2), (2, 3). After it the table will be: 
    
          
    010  
    110  
    

  * operation with cells (1, 2), (2, 1), (2, 2). After it the table will be: 
    
          
    000  
    000  
    

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
int dir[8][2] = {-1, 0, 1, 0, 0, -1, 0, 1, -1, -1, -1, 1, 1, -1, 1, 1};
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> x) {
  os << "(" << x.first << ", " << x.second << ")";
  return os;
}
template <typename S, typename T>
inline bool Min(S &a, const T &b) {
  return a > b ? a = b, true : false;
}
template <typename S, typename T>
inline bool Max(S &a, const T &b) {
  return a < b ? a = b, true : false;
}
template <typename S, typename T>
inline void Adm(S &a, const T &b) {
  a = (a + b) % MOD;
  if (a < 0) a += MOD;
}
template <typename T>
inline bool IsPri(T x) {
  if (x < 2) return false;
  for (T i = 2; i * i <= x; ++i)
    if (x % i == 0) return false;
  return true;
}
template <typename T>
inline T _Gcd(T a, T b) {
  while (b) {
    T t = b;
    b = a % b;
    a = t;
  }
  return a;
}
template <typename T>
inline int _BitCnt(T x) {
  int cnt = 0;
  while (x) ++cnt, x &= x - 1;
  return cnt;
}
inline long long Pow(long long a, long long n) {
  long long t = 1;
  a %= MOD;
  while (n > 0) {
    if (n & 1) t = t * a % MOD;
    a = a * a % MOD, n >>= 1;
  }
  return t % MOD;
}
inline int read() {
  static char buf[1000000], *p1 = buf, *p2 = buf;
  register int x = false;
  register char ch =
      p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
          ? EOF
          : *p1++;
  ;
  register bool sgn = false;
  while (ch != '-' && (ch < '0' || ch > '9'))
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  if (ch == '-')
    sgn = true,
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  while (ch >= '0' && ch <= '9')
    x = (x << 1) + (x << 3) + (ch ^ 48),
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  return sgn ? -x : x;
}
const int N = 110;
int n, m;
char g[N][N];
vector<vector<int>> ans;
void filp(int x1, int y1, int x2, int y2, int x3, int y3) {
  g[x1][y1] ^= 1, g[x2][y2] ^= 1, g[x3][y3] ^= 1;
  ans.push_back({x1, y1, x2, y2, x3, y3});
}
void Filp(int x, int y, int k) {
  if (k == 1) filp(x, y, x, y + 1, x + 1, y);
  if (k == 2) filp(x, y, x, y + 1, x + 1, y + 1);
  if (k == 3) filp(x, y, x + 1, y, x + 1, y + 1);
  if (k == 4) filp(x, y + 1, x + 1, y, x + 1, y + 1);
}
void solve() {
  vector<pair<int, int>> v, v2;
  for (int i = n - 1; i <= n; ++i)
    for (int j = m - 1; j <= m; ++j)
      if (g[i][j] == '1')
        v.push_back({i, j});
      else
        v2.push_back({i, j});
  if (((int)(v).size()) == 4 || ((int)(v).size()) == 3)
    filp(v[0].first, v[0].second, v[1].first, v[1].second, v[2].first,
         v[2].second);
  else if (((int)(v).size()) == 2 || ((int)(v).size()) == 1)
    filp(v2[0].first, v2[0].second, v2[1].first, v2[1].second, v[0].first,
         v[0].second);
}
int main() {
  int T;
  cin >> T;
  while (T--) {
    ans.clear();
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) scanf("%s", g[i] + 1);
    for (int i = 1; i <= n - 2; ++i) {
      for (int j = 1; j < m; j += 2) {
        if (g[i][j] == '1' && g[i][j + 1] == '1')
          Filp(i, j, 1);
        else if (g[i][j] == '1')
          Filp(i, j, 3);
        else if (g[i][j + 1] == '1')
          Filp(i, j, 4);
      }
      if ((m & 1) && g[i][m] == '1') Filp(i, m - 1, 4);
    }
    for (int j = 1; j <= m - 2; ++j)
      if (g[n - 1][j] == '1' && g[n][j] == '1')
        Filp(n - 1, j, 1);
      else if (g[n - 1][j] == '1')
        Filp(n - 1, j, 2);
      else if (g[n][j] == '1')
        Filp(n - 1, j, 4);
    solve();
    solve();
    solve();
    solve();
    printf("%d\n", ((int)(ans).size()));
    for (auto v : ans)
      for (int i = 0; i < 6; ++i) printf("%d%c", v[i], " \n"[i == 5]);
    for (int i = 1; i <= n; ++i)
      for (int j = 1; j <= m; ++j) assert(g[i][j] == '0');
    assert(((int)(ans).size()) <= n * m);
  }
  return 0;
}