//Author:LanceYu

 #include<iostream>

 #include<string>

 #include<cstring>

 #include<cstdio>

 #include<fstream>

 #include<iosfwd>

 #include<sstream>

 #include<fstream>

 #include<cwchar>

 #include<iomanip>

 #include<ostream>

 #include<vector>

 #include<cstdlib>

 #include<queue>

 #include<set>

 #include<ctime>

 #include<algorithm>

 #include<complex>

 #include<cmath>

 #include<valarray>

 #include<bitset>

 #include<iterator>

 #define ll long long

 using namespace std;

 const double clf=1e-;

 //const double e=2.718281828;

 const double PI=3.141592653589793;

 const int MMAX=;

 //priority_queue<int>p;

 //priority_queue<int,vector<int>,greater<int> >pq;

 char map[][];

 int vis[];

 int n,m,sum,num;

 void dfs(int x)//按照行数搜索

 {

     if(m==num)//如果做到了放入n个棋子，方案总数+1

     {

         sum++;

         return;

     }

     if(x>n-)//不能越界

         return;

     for(int j=;j<n;j++)

     {

         if(!vis[j] && map[x][j]=='#')//如果这一层能放，就直接放进去，计数器+1

         {

             vis[j]=;//纵轴标记，不能再次访问

             num++;

             dfs(x+);

             num--;

             vis[j]=;

         }

     }

     dfs(x+); //如果这一行没有，就直接进入下一行，继续搜索

 }

 int main()

 {

     while(scanf("%d%d",&n,&m)!=EOF)

     {

         if(n==-&&m==-)

             return ;

         sum=;num=;

         for(int i=;i<n;i++)

             scanf("%s",map[i]);

         memset(vis,,sizeof(vis));

         dfs();

         printf("%d\n",sum);

     }

     return ;

 }