#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 10
#define M 1<<9-1
int n,m;
int dp[N][M][N];
char ma[N][N];
int dfs(int row,int col,int num)
{
    if(num==m) return 1;
    if(row>=n) return 0;
    if(dp[row][col][num]!=-1) return dp[row][col][num];
    int sum=0;
    for(int i=0;i<n;i++)
    {
        if(ma[row][i]=='#')
        {
            if(col&(1<<i)) continue;
            sum+=dfs(row+1,col|(1<<i),num+1);
        }
    }
    sum+=dfs(row+1,col,num);
    return dp[row][col][num]=sum;
}
int main()
{
    while(~scanf("%d %d",&n,&m)&&n!=-1&&m!=-1)
    {
        for(int i=0; i<n; i++)
              scanf("%s",ma[i]);
        memset(dp,-1,sizeof(dp));
        printf("%d\n",dfs(0,0,0));
    }
    return 0;
}