#include <bits/stdc++.h>
using ll = long long;
using std::cin;
using std::cout;
using std::endl;
std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count());
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int inf = (int)1e9 + 7;
const long long INF = 1LL << 60;

template<typename T>
int GetMex(const std::vector<T>& a) {
  const int n = a.size();
  std::vector<bool> used(n + 1);
  for (auto& e : a) if(e <= n) used[e] = true;
  int res = -1;
  for (int i = 0; i <= n; i++) {
    if (!used[i]) {
      res = i;
      break;
    }
  }
  return res;
}

void solve()
{
  int H, W; cin >> H >> W;
  std::vector<std::vector<bool>> a(W, std::vector<bool>(H));
  for (int i = 0; i < H; ++i)
  {
    std::string s; cin >> s;
    for (int j = 0; j < W; ++j)
    {
      a[j][i] = (s[j] == 'o');
    }
  }
  std::swap(H, W);
  auto calc = [&](const std::vector<bool> &s)->int
  {
    int cur = 1;
    int ret = 0;
    for (int i = 0; i < (int)s.size(); ++i)
    {
      if(s[i])
        ret += cur;
      ret %= 3;
      cur = cur * 2 % 3;
    }
    return ret;
  };
  int XOR = 0;
  for (int i = 0; i < H; ++i)
  {
    XOR ^= calc(a[i]);
  }
  if(XOR)
  {
    cout << "First" << "\n";
  }
  else
  {
    cout << "Second" << "\n";
  }
}
int main()
{
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  int kkt = 1; 
  // cin >> kkt;
  while(kkt--)
    solve();
  return 0;
  
}