import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  debug {
    enum LIM = 1 << 8;
    auto gs = new int[LIM];
    foreach (n; 1 .. LIM) {
      bool[int] app;
      foreach (e; 0 .. bsr(n) + 1) {
        if (n & 1 << e) {
          foreach (f; 0 .. e + 1) {
            if (!(n & ((1 << e) - (1 << f)))) {
              app[gs[n - (1 << f)]] = true;
            }
          }
        }
      }
      for (int g = 0; ; ++g) {
        if (g !in app) {
          gs[n] = g;
          break;
        }
      }
    }
    writeln(gs);
    foreach (n; 0 .. LIM) {
      // writefln("%08b: %s", n, gs[n]);
    }
  }
  
  try {
    for (; ; ) {
      const H = readInt();
      const W = readInt();
      auto B = new string[H];
      foreach (x; 0 .. H) {
        B[x] = readToken();
      }
      
      int ans;
      foreach (y; 0 .. W) {
        int val;
        foreach_reverse (x; 0 .. H) {
          val *= 2;
          if (B[x][y] == 'o') {
            val += 1;
          }
          val %= 3;
        }
        ans ^= val;
      }
      writeln(ans ? "First" : "Second");
    }
  } catch (EOFException e) {
  }
}