#pragma GCC optimize("O3")
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")	
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping") 
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>

using namespace std;

int h,w;
int grundy[305];

int calc(int x)
{
	if(grundy[x]!=-1) return grundy[x];
	if(x==0)
	{
		grundy[x] = x;
		return grundy[x];
	}

	set <int> S;

	//S.insert();

	for(int i=0;i<x;i++)
	{
		int val = 0;
		if(i%2==1) val^=calc(1);
		val^=calc(x-1-i);
		S.insert(val);
	}

	int mex = 0;

	while(1)
	{
		if(S.find(mex)==S.end()) break;
		mex++;
	}

	grundy[x] = mex;
	return grundy[x];
}

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	vector <string> board;
	int val = 0;
	string s;

	cin >> h >> w;

	for(int i=0;i<h;i++)
	{
		cin >> s;
		board.push_back(s);
	}

	memset(grundy,-1,sizeof(grundy));

	for(int j=0;j<w;j++)
	{
		int x = 0;
		for(int i=0;i<h;i++)
		{
			x = 2*x;
			if(board[i][j]=='o') x += 1;
			x%=3;
		}
		val^=x;
	}

	if(val) cout << "First" << '\n';
	else cout << "Second" << '\n';

	return 0;
}