#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int h, w; cin >> h >> w;
  vector<string> b(h); REP(i, h) cin >> b[i];
  int nim = 0;
  REP(j, w) {
    int grundy = 0;
    REP(i, h) grundy = (grundy * 2 + (b[i][j] == 'o')) % 3;
    nim ^= grundy;
  }
  cout << (nim == 0 ? "Second\n" : "First\n");
  return 0;

  vector<int> dp(1 << h, 0);
  FOR(b, 1, 1 << h) {
    set<int> grundy;
    REP(i, h) {
      if (b >> i & 1) {
        grundy.emplace(dp[b ^ (1 << i)]);
        for (int j = i - 1; j >= 0; --j) {
          if (b >> j & 1) break;
          int nx = b ^ (1 << i);
          FOR(k, j, i) nx |= 1 << k;
          grundy.emplace(dp[nx]);
        }
      }
    }
    while (grundy.count(dp[b]) == 1) ++dp[b];
  }
}