#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

long long mod_exp(long long b, long long e, long long m) {
    if (e > 0 && b == 0) return 0;
    long long ans = 1;
    b %= m;

    while (e > 0) {
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b * b) % m;
    }

    return ans;
}


int main()
{

    int Q;
    Q = 1;
    //cin >> Q;



    while (Q--) {
        int n, m;
        cin >> n >> m;
        ll ans = 0;
        int w = n + m - 2;
        vector<string>p(n);
        for (int i = 0; i < n; i++)cin >> p[i];
        
        for (int I = 0; I < (1 << w); I++) {
            int a = 0, b = 0;
            int x = 1;
            for (int i = 0; i < w; i++) {
                if (I & (1 << i))a++;
                else b++;
                if (a >= n || b >= m || a < 0 || b < 0 || p[a][b] == '#' || x < 0) {
                    x = -1; break;
                }
                if (p[a][b] == 'o')x++;
                else x--;
                if (x < 0)break;
               // cout << a<<" "<<b << endl;
            }
            
            if (x >= 0)ans++;
            //cout << I;
        }
        cout << ans;
    }
        return 0;
}