#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000
/*
map<string,int> mp;

int get(string s){
	if(mp.count(s))return mp[s];
	set<int> S;
	rep(i,s.size()){
		if(s[i]=='o'){
			string t = s;
			
			for(int j=i;j>=0;j--){
				if(j!=i && s[j]=='o')break;
				for(int k=j;k<i;k++)t[j] = 'o';
				t[i] = '.';
				S.insert(get(t));
			}
			
			
		}
	}
	
	int ret;
	rep(i,10000){
		if(!S.count(i)){
			ret=  i;
			break;
		}
	}
	mp[s] = ret;
	return ret;
}
*/
int get(string s){
	int n = s.size();
	
	int ret = 0;
	vector<int> dp(n,0);
	
	rep(i,n){
		if(s[i]=='o'){
			dp[i] = 1;
			if(i!=0)dp[i] += dp[i-1];
		}
	}
	
	rep(i,n){
		if(i==n-1 || dp[i+1]==0){
			if(dp[i]%2==0)continue;
			if(i%2==0)ret += 1;
			else ret += 2;
		}
	}
	
	return ret%3;
	
}

int main(){
	
	int h,w;
	cin>>h>>w;
	
	vector<string> s(h);
	rep(i,h){
		cin>>s[i];
	}
	int ans = 0;
	rep(i,w){
		string t = "";
		rep(j,h)t += s[j][i];
		ans ^= get(t);
	}
	
	if(ans==0)cout<<"Second"<<endl;
	else cout<<"First"<<endl;
	
	return 0;
}