#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    /*
    vector<int> g(100);
    g[0] = 0;
    rep2(i, 1, 99){
        set<int> s;
        for(int j = 0; (1<<j) <= i; j++){
            s.emplace(g[i-(1<<j)]);
        }
        int n = 0;
        s.emplace(inf);
        each(e, s){
            if(e != n) {g[i] = n; break;}
            n++;
        }
    }

    rep(i, 100) cout << g[i] << ' '; cout << '\n';
    */
    
    int H, W; cin >> H >> W;

    vector<string> S(H);

    rep(i, H) cin >> S[i];
    
    vector<int> g(W);

    rep(j, W){
        rep(i, H){
            if(S[i][j] == 'o'){
                if(i&1) g[j] += 2;
                else g[j] += 1;
                g[j] %= 3;
            }
        }
    }

    int ans = 0;
    rep(j, W) ans ^= g[j];

    cout << (ans == 0? "Second\n" : "First\n");
    
}