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.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;

/**
 * Created by pranavps on 16-12-2017.
 */

/**
 * This is the template for all coding problems
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task {
        private static long MOD = (long)(1e9+7);
        private int maxNodes = (int)(1e5 + 1);
        private boolean[] win;
        private boolean[] lose;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();

            TrieFast trie = new TrieFast(maxNodes, 26);

            for (int i = 0; i < n; i++) {
                trie.insert(in.next());
            }
            win = new boolean[maxNodes];
            lose = new boolean[maxNodes];

            dfs(trie,0);

            boolean first = false;
            if(!win[0]){
                first = false;
            }
            else if(lose[0])
                first = true;
            else{
                first = (k%2 == 1);
            }

            out.println(first?"First":"Second");
        }

        private void dfs(TrieFast trie, int node){
            boolean leaf = true;
            for (int i = 0; i < 26; i++) {
                if(trie.trie[node][i] != -1){
                    leaf = false;
                    dfs(trie,trie.trie[node][i]);
                    win[node] |= !win[trie.trie[node][i]];
                    lose[node] |= !lose[trie.trie[node][i]];
                }
            }
            if(leaf){
                win[node] = false;
                lose[node] = true;
            }
        }


    }

    static class TrieFast {
        boolean[] isLeaf;
        int[][] trie;
        int next;

        public TrieFast(int maxNodes, int maxValue){
            next = 1;
            isLeaf = new boolean[maxNodes];
            trie = new int[maxNodes][maxValue];
            for (int i = 0; i < maxNodes; ++i)
                Arrays.fill(trie[i], -1);
        }

        public void insert(String s){
            int curNode = 0;
            for (int i = 0; i < s.length(); i++) {
                if(trie[curNode][hash(s.charAt(i))] == -1){
                    curNode = trie[curNode][hash(s.charAt(i))] = next++;
                }
                else
                    curNode = trie[curNode][hash(s.charAt(i))];
            }
            isLeaf[curNode] = true;
        }

        //TODO: Change according to problem
        private int hash(char c){
            return c - 'a';
        }

        // Returns if the word is in the trie.
        public boolean search(String word) {
            int t = searchNode(word);
            return (t != -1 && isLeaf[t]);
        }

        // Returns if there is any word in the trie
        // that starts with the given prefix.
        public boolean startsWith(String prefix) {
            return searchNode(prefix) != -1;
        }

        public int searchNode(String str){
            int t = 0;
            for(int i = 0; (t != -1) && i < str.length(); i++){
                int idx = hash(str.charAt(i));
                t = trie[t][idx];
            }
            return t;
        }
    }


    static 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 int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public int[] nextIntArray(int n){
            int[] arr = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextInt();
            }
            return arr;
        }

        public long[] nextLongArray(int n){
            long[] arr = new long[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextLong();
            }
            return arr;
        }
    }
}
