#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;i<n;i++)
#define REP(i,a,n) for(ll i=a;i<n;i++)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define pb eb
#define be(v) (v).begin(),(v).end()
#define all(i,v) for(auto& i : v)
#define all2(i,j,v) for(auto& [i,j] : v)
template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

// cin.tie(nullptr);
// ios::sync_with_stdio(false);
// cout << fixed << setprecision(20);

void solve(){
  ll h,w;
  cin >> h >> w;
  V<string>v(h);
  rep(i,h) cin >> v[i];
  ll p = (1<<(h+w-2));
  ll ans = 0;
  
  rep(i,p){
  	ll cnt = 1;
  	ll x = 0, y = 0;
  	ll chk = 0;
  	rep(j, h+w-2) chk += (i>>j)&1;
  	if(chk != w-1) continue;
  	rep(j,h+w-2){
  		if((i>>j)&1) y++;
  		else x++;
  		if(v[x][y]=='o') cnt++;
  		else if(v[x][y] == 'x') cnt--;
  		else cnt = -INF;
  		if(cnt < 0) cnt = -INF;
  	}
  	if(cnt >= 0) ans++;
  }
  cout << ans << endl;
  
}





int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int t=1;
  // cin >> t;
  rep(i,t) solve();
}