// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn test() {
    let n = 1 << 20;
    let mut dp = vec![0; n + 1];
    for i in 1..=n {
        let mut set = Set::new();
        let mut j = 1;
        while j <= i {
            set.insert(dp[i - j]);
            j *= 2;
        }
        let mut g = 0;
        while set.contains(&g) {
            g += 1;
        }
        dp[i] = g;
        assert!(i % 3 == g);
    }
}

fn run() {
    input! {
        h: usize,
        w: usize,
        s: [bytes; h],
    }
    let mut g = 0;
    for j in 0..w {
        let mut v = 0;
        for s in s.iter().rev() {
            v = v * 2 % 3;
            if s[j] == b'o' {
                v = (v + 1) % 3;
            }
        }
        g ^= v;
    }
    if g == 0 {
        println!("Second");
    } else {
        println!("First");
    }
}

fn main() {
    run();
}