Andrew, Fedor and Alex are inventive guys. Now they invent the game with strings for two players.

Given a group of n non-empty strings. During the game two players build the word together, initially the word is empty. The players move in turns. On his step player must add a single letter in the end of the word, the resulting word must be prefix of at least one string from the group. A player loses if he cannot move.

Andrew and Alex decided to play this game k times. The player who is the loser of the i-th game makes the first move in the (i + 1)-th game. Guys decided that the winner of all games is the player who wins the last (k-th) game. Andrew and Alex already started the game. Fedor wants to know who wins the game if both players will play optimally. Help him.

Input

The first line contains two integers, n and k (1 ≤ n ≤ 105; 1 ≤ k ≤ 109).

Each of the next n lines contains a single non-empty string from the given group. The total length of all strings from the group doesn't exceed 105. Each string of the group consists only of lowercase English letters.

Output

If the player who moves first wins, print "First", otherwise print "Second" (without the quotes).

Examples

Input

2 3
a
b


Output

First


Input

3 1
a
b
c


Output

First


Input

1 2
ab


Output

Second
import java.util.*;
import java.io.*;
public class B {
    static class ST {
        Character cur;
        HashMap<Character, ST> children = new HashMap<>();
        ST(Character cur) {
            this.cur = cur;
        }
        void insert(String s) {
            if (s.length() == 0) return;
            char c = s.charAt(0);
            String child = s.substring(1);
            if (!children.containsKey(c)) {
                children.put(c, new ST(c));
            }
            children.get(c).insert(child);
        }
        boolean res(boolean fw, boolean sw) {
            if (children.size() == 0) return false;
            for (Map.Entry<Character, ST> child : children.entrySet()) {
                ST st = child.getValue();
                boolean cr = st.res(sw, fw);
                if (fw && !cr) return true;
                if (!fw && cr) return false;
            }
            return !fw;
        }
    }
    static void solve() {
        int N, K;
        N = in.nextInt();
        K = in.nextInt();
        ST st = new ST(null);
        for (int i = 0; i < N; i++) {
            st.insert(in.next());
        }
        boolean first = false;
        boolean ww = st.res(true, true);
        boolean wl = st.res(true, false);
        boolean lw = st.res(false, true);
        boolean ll = st.res(false, false);
        // out.println(ww + " " + wl + " " + lw + " " + ll);
        if (!ll && ww) first = true;
        if (ww && ll && K % 2 == 1) first = true;
        if (first) out.println("First");
        else out.println("Second");
    }
    static PrintWriter out = new PrintWriter(System.out);
    static InputReader in = new InputReader(System.in);
    static void d(Object o) {
        out.println(o);
        out.flush();
    }
    public static void main(String args[]) {
        solve();
        out.close();
    }
}
class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;
    public InputReader(InputStream stream) {
	reader = new BufferedReader(new InputStreamReader(stream), 32768);
	tokenizer = null;
    }
    public String next() {
	while (tokenizer == null || !tokenizer.hasMoreTokens()) {
	    try {
		tokenizer = new StringTokenizer(reader.readLine());
	    } catch (IOException e) {
		throw new RuntimeException(e);
	    }
	}
	return tokenizer.nextToken();
    }
    public double nextDouble() {
	return Double.parseDouble(next());
    }
    public long nextLong() {
	return Long.parseLong(next());
    }
    public int nextInt() {
	return Integer.parseInt(next());
    }
}
