#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
using Graph = vector<vector<tuple<int,int,char>>>;

const ll mod = 1000000007;

int main() {
    ll H,W;
    cin >> H >> W;
    char g[H][W];
    rep(i,H){
        rep(j,W){
            cin >> g[i][j];
        }
    }
    string ans = "First";
    ll gn[W];
    rep(i,W){
        ll n = 0;
        rep(j,H){
            if(g[j][i]=='o'){
                n += j%2 +1;
            }
        }
        n %= 3; gn[i] = n;
    }
    ll judge = 0;
    rep(i,W) judge ^= gn[i];
    if(judge==0) ans = "Second";
    cout << ans << endl;
}