A

//纯dfs()

#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cstring>

using namespace std;
const int maxn = 10;
char g[maxn][maxn];
bool vis[maxn];        //列标记
int n, k;
int ans;

void dfs(int nowx,int num){
    if (num == k){
        ans++;
        return;
    }
    
    if (nowx >= n)    //越界
        return;

    for (int i = 0; i < n; i++){
        if (g[nowx][i] == '#' && !vis[i]){
            vis[i] = 1;
            dfs(nowx + 1, num + 1);
            vis[i] = 0;
        }
    }
    dfs(nowx + 1, num);
    return;
}

int main(){
    while (~scanf("%d %d", &n, &k)){
        if (n == -1 && k == -1)
            break;
        ans = 0;
        memset(vis, 0, sizeof(vis));
        for (int i = 0; i < n; i++){
            scanf("%s", &g[i]);
        }
        dfs(0, 0);
        printf("%d
", ans);
    }
    //system("pause");
    return 0;
}