#ifndef akinyan
#define akinyan
#include <bits/stdc++.h>
using namespace std;
using ch = char;
using ll = long long;
using ld = long double;
using db = double;
using st = string;
using vdb = vector<db>;
using vvdb = vector<vdb>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<ld>;
using vvd = vector<vd>;
using vs = vector<st>;
using vvs = vector<vs>;
using vc = vector<ch>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
const ll mod = 998244353;
const ll MOD = 1000000007;
const ll INF = 1000000000000000000LL;
using pall = pair<ll,ll>;
using vp = vector<pall>;
#endif

int main(){
    ll H,W;
    cin>>H>>W;
    vs S(H);
    for(int i=0; i<H; i++){
        cin>>S[i];
    }
    vl A;
    for(int i=0; i<H-1; i++){
        A.push_back(0);
    }
    for(int i=0; i<W-1; i++){
        A.push_back(1);
    }
    ll ans = 0;
    do{
        bool f = false;
        ll now = 1;
        ll nowx = 0, nowy = 0;
        for(auto a:A){
            if(a == 0){
                nowx++;
            }
            else{
                nowy++;
            }
            if(S[nowx][nowy] == 'o'){
                now++;
            }
            else if(S[nowx][nowy] == 'x'){
                now--;
            }
            else{
                f = true;
                break;
            }
            if(now < 0){
                f = true;
                break;
            }
        }
        if(f){
            continue;
        }
        ans++;
    }while(next_permutation(A.begin(),A.end()));
    cout << ans << endl;
}