#pragma GCC optimize(2,3,"Ofast","inline","-ffast-math") #pragma GCC target("sse2,sse3,sse4,mmx") #pragma omp parallel for #pragma omp parallel num_threads(thread_count) #pragma omp critical #pragma omp parallel for reduction(+:sum) #include<bits/stdc++.h> using namespace std; int n,k,i,j,sum=0; bool lie[10],a[10][10]; string sg; void dfs(int s,int ac){ if(sk){ sum++; return; } if(acn) return; for(int i=0;i<n;i++){ if(!lie[i]&&a[ac][i]){ lie[i]=1; dfs(s+1,ac+1); lie[i]=0; } } dfs(s,ac+1); } int main(){ while(1){ cin>>n>>k; if(n==-1&&k==-1) break; memset(lie,0,sizeof(lie)); memset(a,0,sizeof(a)); for(i=0;i<n;i++){ cin>>sg; for(j=0;j<n;j++){ if(sg[j]=='#') a[i][j]=1; } } sum=0; dfs(0,0); cout<<sum<<'\n'; // cout<<"hello?"; // cout<<"Where is the human?"; // cout<<"Human!Where are you going??"; } return 0; }