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.*;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
import java.util.concurrent.ArrayBlockingQueue;

/**
 * Created by hama_du on 2014/08/09.
 */
public class ProblemB {

    static class Node {
        int depth;
        Node[] next = new Node[26];

        Node grow(char c) {
            int idx = c - 'a';
            if (next[idx] == null) {
                next[idx] = new Node();
                next[idx].depth = this.depth + 1;
            }
            return next[idx];
        }
    }

    static class State {
        Node node;
        int which;
        int depth;

        State (Node n, int w, int d) {
            node = n;
            which = w;
            depth = d;
        }
    }

    public static boolean gameWin(Node node) {
        boolean canWin = false;
        for (int i = 0 ; i < 26 ; i++) {
            if (node.next[i] != null) {
                canWin |= !gameWin(node.next[i]);
            }
        }
        return canWin;
    }

    public static boolean gameLose(Node node) {
        boolean canLose = false;
        boolean hasNext = false;
        for (int i = 0 ; i < 26 ; i++) {
            if (node.next[i] != null) {
                hasNext = true;
                if (!gameLose(node.next[i])) {
                    canLose = true;
                    break;
                }
            }
        }
        if (hasNext && !canLose) {
            return false;
        }
        return true;
    }

    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);

        String[] nk = in.readLine().split(" ");
        int n = Integer.valueOf(nk[0]);
        int k = Integer.valueOf(nk[1]);

        char[][] data = new char[n][];
        for (int i = 0 ; i < n ; i++) {
            data[i] = in.readLine().toCharArray();
        }


        Node root = new Node();
        root.depth = 0;

        Queue<State> q = new ArrayBlockingQueue<State>(100000 * 4);

        for (int i = 0 ; i < n ; i++) {
            q.add(new State(root, i, 0));
        }
        while (q.size() >= 1) {
            State state = q.poll();
            Node node = state.node;
            char[] col = data[state.which];
            int len = col.length;
            if (state.depth < len) {
                char c = col[state.depth];
                Node next = node.grow(c);
                q.add(new State(next, state.which, state.depth+1));
            }
        }

        boolean canWinFirst = gameWin(root);
        boolean canLoseFirst = gameLose(root);
        boolean answer = true;

        if (canWinFirst) {
            if (canLoseFirst) {
                answer = true;
            } else {
                answer = (k % 2 == 1);
            }
        } else {
            if (canLoseFirst) {
                answer = false;
            } else {
                answer = false;
            }
        }

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

    static void debug(Object... obj) {
        System.err.println(Arrays.deepToString(obj));
    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int next() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = next();
            while (isSpaceChar(c))
                c = next();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = next();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = next();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }

}
