#include <bits/stdc++.h>

using namespace std;

// c++ short types
#define vt vector
typedef long long ll;
typedef long double ld;

void whattime() { cout << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl; }
const int inf = 1e9;
const int mod = 998244353;
bool debug = false;

const int nmax = 20;
int dp[nmax][nmax][nmax][nmax];

void solve() {
	memset(dp, -1, sizeof(dp));
	int n, m; cin >> n >> m;
	vt<string> s(n);
	for(auto &x: s) {
		cin >> x;
	}
	const int k = 3 * n * m;
	auto Dfs = [&](auto self, int a, int b, int c, int d) {
		if(a > b || c > d) {
			return 0;
		}
		if(dp[a][b][c][d] != -1) {
			return dp[a][b][c][d];
		}
		vt<int> cnt(k, 0);
		int kol = 0;
		for(int x = a; x <= b; ++x) {
			for(int y = c; y <= d; ++y) if(s[x][y] != 'X') {
				++kol;
				int value = self(self, a, x-1, c, y-1) ^ self(self, a, x-1, y + 1, d) ^ self(self, x+1, b, c, y-1) ^ self(self, x + 1, b, y + 1, d);
				if(a < b and c < d) {
//					cout << "value=" << value << " " << cnt[0] << "@\n";
				}
				if(value < k) {
					cnt[value] ++;
				}
			}
		}
		int mex = 0;
		if(kol) {
			while(cnt[mex]) {
				mex++;
			}
		}
//		for(auto x: {a,b,c,d}) {
//			cout << x << " ";
//		}
//		cout << " mex=" << mex << "\n";
		return dp[a][b][c][d] = mex;
	};
	if(Dfs(Dfs, 0, n-1, 0, m-1)) {
		cout << "First\n";
	} else {
		cout << "Second\n";
	}
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(nullptr);
	int tt = 1;
	if(debug) {
		tt = 1e3;
	} else {
//		cin >> tt;
	}
	for(int t = 0; t < tt; ++t) {
		solve();
	}
	return 0;
}