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  
    
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.InputMismatchException;
import java.util.*;
import java.io.*;
import java.lang.*;
public class Main{
    public static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;
        private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
     
        public InputReader(InputStream stream) {
            this.stream = stream;
        }
     
        public int read() {
            if (numChars==-1)
                throw new InputMismatchException();
     
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                }
                catch (IOException e) {
                    throw new InputMismatchException();
                }
     
                if(numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }
     
        public String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
        public int nextInt() {
            int c = read();
     
            while(isSpaceChar(c))
                c = read();
     
            int sgn = 1;
     
            if (c == '-') {
                sgn = -1;
                c = read();
            }
     
            int res = 0;
            do {
                if(c<'0'||c>'9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));
     
            return res * sgn;
        }
     
        public long nextLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
     
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));
            return res * sgn;
        }
     
        public double nextDouble() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') {
                c = read();
                double m = 1;
                while (!isSpaceChar(c)) {
                    if (c == 'e' || c == 'E')
                        return res * Math.pow(10, nextInt());
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }
     
        public String readString() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            }
            while (!isSpaceChar(c));
     
            return res.toString();
        }
     
        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
     
        public String next() {
            return readString();
        }
     
        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }
 
    static long gcd(long a, long b){
        if (a == 0)
            return b;  
        return gcd(b % a, a);  
    }
    static long lcm(long a, long b)  {
        return (a*b)/gcd(a, b);  
    }
    public static void sortbyColumn(int arr[][], int col) 
    { 
        
        Arrays.sort(arr, new Comparator<int[]>() { 
            
          @Override              
          
          public int compare(final int[] entry1,  
                             final int[] entry2) { 
  
            
            if (entry1[col] > entry2[col]) 
                return 1; 
            else
                return -1; 
          } 
        });  
    } 
    static long func(long a[],int size,int s){
        long max1=a[s];
        long maxc=a[s];
        for(int i=s+1;i<size;i++){
            maxc=Math.max(a[i],maxc+a[i]);
            max1=Math.max(maxc,max1);
        }
        return max1;
    }
    public static class Pair<U extends Comparable<U>, V extends Comparable<V>> implements Comparable<Pair<U, V>> {
        public U x;
        public V y;
    
        public Pair(U x, V y) {
            this.x = x;
            this.y = y;
        }
    
        public int hashCode() {
            return (x == null ? 0 : x.hashCode() * 31) + (y == null ? 0 : y.hashCode());
        }
    
        public boolean equals(Object o) {
            if (this == o)
                return true;
            if (o == null || getClass() != o.getClass())
                return false;
            Pair<U, V> p = (Pair<U, V>) o;
            return (x == null ? p.x == null : x.equals(p.x)) && (y == null ? p.y == null : y.equals(p.y));
        }
    
        public int compareTo(Pair<U, V> b) {
            int cmpU = x.compareTo(b.x);
            return cmpU != 0 ? cmpU : y.compareTo(b.y);
        }
    
        public String toString() {
            return String.format("(%s, %s)", x.toString(), y.toString());
        }
    
    }
    static class MultiSet<U extends Comparable<U>> {
        public int sz = 0;
        public TreeMap<U, Integer> t;
 
        public MultiSet() {
            t = new TreeMap<>();
        }
 
        public void add(U x) {
            t.put(x, t.getOrDefault(x, 0) + 1);
            sz++;
        }
 
        public void remove(U x) {
            if (t.get(x) == 1) t.remove(x);
            else t.put(x, t.get(x) - 1);
            sz--;
        }
 
    }
    static void shuffle(int[] a) {
        Random get = new Random();
        for (int i = 0; i < a.length; i++) {
            int r = get.nextInt(a.length);
            int temp = a[i];
            a[i] = a[r];
            a[r] = temp;
        }
    }
    static long myceil(long a, long b){
        return (a+b-1)/b;
    }
    
    static long C(long n,long r){
        long count=0,temp=n;
        long ans=1;
        long num=n-r+1,div=1;
        while(num<=n){
            ans*=num;
            //ans+=MOD;
            ans%=MOD;
            ans*=mypow(div,MOD-2);
            //ans+=MOD;
            ans%=MOD;
            num++;
            div++;
        }
        
        ans+=MOD;
        return ans%MOD;
    }
    static long fact(long a){
        long i,ans=1;
        for(i=1;i<=a;i++){
            ans*=i;
            ans%=MOD;
        }
        return ans%=MOD;
    }
    static void sieve(int n){
        is_sieve[0]=1;
        is_sieve[1]=1;
        int i,j,k;
        for(i=2;i<n;i++){
            if(is_sieve[i]==0){
                sieve[i]=i;
                tr.add(i);
                for(j=i*i;j<n;j+=i){
                    if(j>n||j<0){
                        break;
                    }
                    is_sieve[j]=1;
                    sieve[j]=i;
                }
            }
        }
    }
    static void calc(int n){
        int i,j;
        dp[n-1]=0;
        if(n>1)
        dp[n-2]=1;
        for(i=n-3;i>=0;i--){
            long ind=n-i-1;
            dp[i]=((ind*(long)mypow(10,ind-1))%MOD+dp[i+1])%MOD;
        }
    }
    static long mypow(long x,long y){
        long temp; 
        if( y == 0) 
            return 1; 
        temp = mypow(x, y/2); 
        if (y%2 == 0) 
            return (temp*temp)%MOD; 
        else
            return ((x*temp)%MOD*(temp)%MOD)%MOD; 
    }
    static long dist[],dp[];
    static int visited[][];
    static ArrayList<Integer> adj[];
    //static int dp[][][];
    static int R,G,B,MOD=1000000007;
    static int[] par,size;
    static int[] sieve,is_sieve;
    static TreeSet<Integer> tr;
    static char ch[][], ch1[][];
    
    static int[] getans(int x,int y, int oc){
        int i,j;
        int ans[]=new int[6];
        int c=0;
        if(oc==3){
            for(i=x;i<x+2;i++){
                for(j=y;j<y+2;j++){
                    if(ch[i][j]=='1'){
                        ans[c]=i+1;
                        ans[c+1]=j+1;
                        ch[i][j]='0';
                        c+=2;
                    }
                    if(c==6){
                        break;
                    }
                }
                if(c==6){
                    break;
                }
            }
        }else{
            int flag=0;
            int x1=0,y1=0;
            for(i=x;i<x+2;i++){
                for(j=y;j<y+2;j++){
                    if(flag==0&&ch[i][j]=='1'){
                        flag=1;
                        ans[c]=i+1;
                        ans[c+1]=j+1;
                        x1=i;y1=j;
                        //ch[i][j]='0';
                        c+=2;
                        break;
                    }
                }
                if(flag==1){
                    break;
                }
            }
            for(i=x;i<x+2;i++){
                for(j=y;j<y+2;j++){
                    if(ch[i][j]=='0'){
                        ans[c]=i+1;
                        ans[c+1]=j+1;
                        ch[i][j]='1';
                        c+=2;
                    }
                    if(c==6){
                        break;
                    }
                }
                if(c==6){
                    break;
                }
            }
            ch[x1][y1]='0';
        }
        return ans;
    }
    
    public static void main(String args[]){
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter w = new PrintWriter(outputStream);
        int t,i,j,tno=0;
        t=in.nextInt();
        //t=1;
        while(t-->0){
            int n,m;
            n=in.nextInt();
            m=in.nextInt();
            String s[]=new String[n];
            ch=new char[n][];
            ch1=new char[n][];
            for(i=0;i<n;i++){
                s[i]=in.next();
                ch[i]=s[i].toCharArray();
                ch1[i]=s[i].toCharArray();
            }
            int ans=0,zc=0,oc=0;
            
            for(i=0;i<n-1;i++){
                for(j=0;j<m-1;j++){
                    oc=0;zc=0;
                    if(ch[i][j]=='0'){
                        zc++;
                    }else{
                        oc++;
                    }
                    if(ch[i+1][j]=='0'){
                        zc++;
                    }else{
                        oc++;
                    }
                    if(ch[i][j+1]=='0'){
                        zc++;
                    }else{
                        oc++;
                    }
                    if(ch[i+1][j+1]=='0'){
                        zc++;
                    }else{
                        oc++;
                    }
                    if(oc==4){
                        // w.println((i+1)+" "+(j+1)+" "+(i+2)+" "+(j+1)+" "+(i+1)+" "+(j+2));
                        ch[i][j]=ch[i+1][j]=ch[i][j+1]='0';
                        oc=1;
                        ans++;
                    }
                    if(oc==1){
                        int te[]=new int[6];
                        te=getans(i,j,oc);
                        // for(int k=0;k<6;k++){
                        //     w.print(te[k]+" ");
                        // }
                        // w.println();
                        oc++;
                        ans++;
                    }
                    if(oc==2){
                        int te[]=new int[6];
                        te=getans(i,j,oc);
                        // for(int k=0;k<6;k++){
                        //     w.print(te[k]+" ");
                        // }
                        // w.println();
                        
                        oc++;
                        ans++;
                    }
                    if(oc==3){
                        int te[]=new int[6];
                        te=getans(i,j,oc);
                        // for(int k=0;k<6;k++){
                        //     w.print(te[k]+" ");
                        // }
                        // w.println();
                        ans++;
                    }
                    if(j+2<m-1){
                        j++;
                    }
                }
                if(i+2<n-1){
                    i++;
                }
            }
            w.println(ans);
            for(i=0;i<n;i++){
                for(j=0;j<m;j++){
                    ch[i][j]=ch1[i][j];
                }
            }
            for(i=0;i<n-1;i++){
                for(j=0;j<m-1;j++){
                    oc=0;zc=0;
                    if(ch[i][j]=='0'){
                        zc++;
                    }else{
                        oc++;
                    }
                    if(ch[i+1][j]=='0'){
                        zc++;
                    }else{
                        oc++;
                    }
                    if(ch[i][j+1]=='0'){
                        zc++;
                    }else{
                        oc++;
                    }
                    if(ch[i+1][j+1]=='0'){
                        zc++;
                    }else{
                        oc++;
                    }
                    if(oc==4){
                        w.println((i+1)+" "+(j+1)+" "+(i+2)+" "+(j+1)+" "+(i+1)+" "+(j+2));
                        ch[i][j]=ch[i+1][j]=ch[i][j+1]='0';
                        oc=1;
                        ans++;
                    }
                    if(oc==1){
                        int te[]=new int[6];
                        te=getans(i,j,oc);
                        for(int k=0;k<6;k++){
                            w.print(te[k]+" ");
                        }
                        w.println();
                        oc++;
                        ans++;
                    }
                    if(oc==2){
                        int te[]=new int[6];
                        te=getans(i,j,oc);
                        for(int k=0;k<6;k++){
                            w.print(te[k]+" ");
                        }
                        w.println();
                        
                        oc++;
                        ans++;
                    }
                    if(oc==3){
                        int te[]=new int[6];
                        te=getans(i,j,oc);
                        for(int k=0;k<6;k++){
                            w.print(te[k]+" ");
                        }
                        w.println();
                        ans++;
                    }
                    if(j+2<m-1){
                        j++;
                    }
                }
                if(i+2<n-1){
                    i++;
                }
            }
            
        }
        w.close();
    }
}