import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static int result=0;
    public static void main(String args[]) throws IOException{
        int caseNum=0;
        int row=0;
        String temp="";
        Scanner sc = new Scanner(System.in);
        caseNum=Integer.parseInt(sc.nextLine());
        List<ArrayList<ArrayList<Character>>> boards=new ArrayList<ArrayList<ArrayList<Character>>>();
        for(int i=0;i<caseNum;i++)
        {
            boards.add(new ArrayList<ArrayList<Character>>());
            temp=sc.nextLine();
            row=Integer.parseInt(temp.split(" ")[0]);
            for(int j=0;j<row;j++)
            {
                boards.get(i).add(new ArrayList<Character>());
                temp=sc.nextLine();//오류발생부분
                for(int k=0;k<temp.length();k++){
                    boards.get(i).get(j).add(temp.charAt(k));
                }
            }
        }
        for(int i=0;i<caseNum;i++)
        {
            solver(boards.get(i),boards.get(i).size(),boards.get(i).get(0).size(),0);
            System.out.println(result);
            result=0;
        }
        sc.close();
        return;
    }
    public static void solver(ArrayList<ArrayList<Character>> board,int row,int col, int depth)
    {
        //왼쪽 방향으로 진행, 끝에 도달하면 아래행으로 넘어감
        for(int i=0;i<row;i++)
        {
            for(int j=0;j<col;j++)
            {
                //빈칸이 처음 발견되는 곳에서 시작
                if(board.get(i).get(j)=='.')
                {
                    //ㄱ자 모양 벽돌을 놓을수 있는 경우의 수는 총 다섯가지, 가능한 경우에 재귀호출, return될 경우 벽돌을 리셋
                    if(i+1<row&&j+1<col&&board.get(i).get(j+1)=='.'&&board.get(i+1).get(j)=='.')
                    {
                        board.get(i).set(j,'#');
                        board.get(i).set(j+1,'#');
                        board.get(i+1).set(j,'#');
                        solver(board,row,col,depth+1);
                        board.get(i).set(j,'.');
                        board.get(i).set(j+1,'.');
                        board.get(i+1).set(j,'.');
                    }
                    if(i+1<row&&j+1<col&&board.get(i).get(j+1)=='.'&&board.get(i+1).get(j+1)=='.')
                    {
                        board.get(i).set(j,'#');
                        board.get(i).set(j+1,'#');
                        board.get(i+1).set(j+1,'#');
                        solver(board,row,col,depth+1);
                        board.get(i).set(j,'.');
                        board.get(i).set(j+1,'.');
                        board.get(i+1).set(j+1,'.');
                    }
                    if(i+1<row&&j+1<col&&board.get(i+1).get(j+1)=='.'&&board.get(i+1).get(j)=='.')
                    {
                        board.get(i).set(j,'#');
                        board.get(i+1).set(j,'#');
                        board.get(i+1).set(j+1,'#');
                        solver(board,row,col,depth+1);
                        board.get(i).set(j,'.');
                        board.get(i+1).set(j,'.');
                        board.get(i+1).set(j+1,'.');
                    }
                    if(i-1>=0&&j+1<col&&board.get(i).get(j+1)=='.'&&board.get(i-1).get(j+1)=='.')
                    {
                        board.get(i).set(j,'#');
                        board.get(i).set(j+1,'#');
                        board.get(i-1).set(j+1,'#');
                        solver(board,row,col,depth+1);
                        board.get(i).set(j,'.');
                        board.get(i).set(j+1,'.');
                        board.get(i-1).set(j+1,'.');
                    }
                    if(i+1<row&&j-1>=0&&board.get(i+1).get(j-1)=='.'&&board.get(i+1).get(j)=='.')
                    {
                        board.get(i).set(j,'#');
                        board.get(i+1).set(j-1,'#');
                        board.get(i+1).set(j,'#');
                        solver(board,row,col,depth+1);
                        board.get(i).set(j,'.');
                        board.get(i+1).set(j-1,'.');
                        board.get(i+1).set(j,'.');
                    }
                    return;
                }
            }
        }
        //최초에 모두 막힌벽돌이었을 경우 성공으로 처리되는 예외를 방지하기 위함
        if(depth!=0)
            result=result+1;
        return;
    }
}