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 Tanmay273 
{
    public static void main(String args[]) throws Exception
    {
        InputScanner r = new InputScanner();
        PrintWriter w = new PrintWriter(System.out);
        StringTokenizer st ;
        st = new StringTokenizer(r.nextLine());
        int n = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());
        Trie game = new Trie();
        for(int i=0;i<n;i++)
        {
            String s = r.nextLine();
            game.add(s);
        }
        game.root.solve();
        if(!game.root.win)
        {
            w.write("Second");
        }
        else if(game.root.win&&game.root.lose)
        {
            w.write("First");
        }
        else
        {
            if(k%2==1)
            {
                w.write("First");
            }
            else
            {
                w.write("Second");
            }
        }
        w.close();
    }
    
    public static class Node
    {
        boolean leaf;
        boolean win;
        boolean lose;
        Node []children;
        public Node()
        {
            leaf = true;
            win = false;
            lose = false;
            children = new Node[26];
        }
        public void solve()
        {
            if(leaf)
            {
                win = false;
                lose = true;
                return ;
            }
            for(int i=0;i<26;i++)
            {
                if(children[i]!=null)
                {
                    children[i].solve();
                    win|=!children[i].win;
                    lose |=!children[i].lose;
                    if(win==true&&lose==true)
                    {
                        break;
                    }
                }
            }
        }
    }
    public static class Trie
    {
        Node root;
        public Trie()
        {
            root = new Node();
        }
        public void add(String s)
        {
            Node curr = root;
            for(int i=0;i<s.length();i++)
            {
                if(curr.children[s.charAt(i)-'a']==null)
                {
                    curr.children[s.charAt(i)-'a'] = new Node();
                    curr.leaf = false;
                }
                curr = curr.children[s.charAt(i)-'a'];
            }
        }
    }
    public static class InputScanner
    {
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

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

        public String nextLine() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isEndOfLine(c));
            return res.toString();
        }

        public String nextString() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

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

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

        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;
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        private boolean isEndOfLine(int c) {
            return c == '\n' || c == '\r' || c == -1;
        }
    }
}