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.*;

public class Solution {
    static Trie root;
    public static void main(String[] args) throws IOException {
        FastReader in = new FastReader(System.in);
        String str;
        StringBuilder sb = new StringBuilder();
        int i, j, x, y;
        int n = in.nextInt();
        int k=in.nextInt();
        root = new Trie();
        for (i = 0; i < n; i++) {
            insert(in.next());
        }
        boolean ans1=solve2(root);
        boolean ans2=solve1(root);
        //System.out.println(ans1+" "+ans2);
        if((ans1 && ans2) || (!ans1 && ans2 && k%2==1))
            System.out.println("First");
        else
            System.out.println("Second");


    }
    static class Trie {
        Trie child[] = new Trie[26];
        boolean end;

        Trie() {
            end = false;
            for (int i = 0; i < 26; i++)
                child[i] = null;
        }
    }
    public static void insert(String s)
    {
        Trie x=root;
        int l=s.length();
        int ind;
        for(int i=0;i<l;i++)
        {
            ind=s.charAt(i)-'a';
            //System.out.println(s.charAt(i));
            if(x.child[ind]==null)
                x.child[ind]=new Trie();
            x=x.child[ind];
        }
        x.end=true;
    }
    public static boolean solve1(Trie x)
    {
        int i,f=0;
        boolean ans=false;
        for(i=0;i<26;i++) {

            if(x!=root) {
                ans=true;
                if (x.child[i] != null) {
                    f = 1;
                    if (solve1(x.child[i])) {
                        ans = false;
                        break;
                    }
                }
            }
            else
            {
                ans=false;
                if(x.child[i]!=null)
                {
                    f=1;
                    if(solve1(x.child[i]))
                    {
                        ans=true;
                        break;
                    }
                }
            }
        }
        if(f==0)
            return true;
        return ans;
    }
    public static boolean solve2(Trie x)
    {
        int i,f=0;
        boolean ans=false;
        for(i=0;i<26;i++) {
            if(x!=root) {
                ans=true;
                if (x.child[i] != null) {
                    f = 1;
                    if (solve2(x.child[i])) {
                        ans = false;
                        break;
                    }
                }
            }
            else
            {
                ans=false;
                if(x.child[i]!=null)
                {
                    f=1;
                    if(solve2(x.child[i]))
                    {
                        ans=true;
                        break;
                    }
                }
            }
        }
        if(f==0)
            return false;
        return ans;
    }


}
class FastReader {

    byte[] buf = new byte[2048];
    int index, total;
    InputStream in;

    FastReader(InputStream is) {
        in = is;
    }

    int scan() throws IOException {
        if (index >= total) {
            index = 0;
            total = in.read(buf);
            if (total <= 0) {
                return -1;
            }
        }
        return buf[index++];
    }

    String next() throws IOException {
        int c;
        for (c = scan(); c <= 32; c = scan());
        StringBuilder sb = new StringBuilder();
        for (; c > 32; c = scan()) {
            sb.append((char) c);
        }
        return sb.toString();
    }
    String nextLine() throws IOException {
        int c;
        for (c = scan(); c <= 32; c = scan());
        StringBuilder sb = new StringBuilder();
        for (; c !=10 && c!=13; c = scan()) {
            sb.append((char) c);
        }
        return sb.toString();
    }
    char nextChar() throws IOException{
        int c;
        for (c = scan(); c <= 32; c = scan());
        return (char)c;
    }

    int nextInt() throws IOException {
        int c, val = 0;
        for (c = scan(); c <= 32; c = scan());
        boolean neg = c == '-';
        if (c == '-' || c == '+') {
            c = scan();
        }
        for (; c >= '0' && c <= '9'; c = scan()) {
            val = (val << 3) + (val << 1) + (c & 15);
        }
        return neg ? -val : val;
    }

    long nextLong() throws IOException {
        int c;
        long val = 0;
        for (c = scan(); c <= 32; c = scan());
        boolean neg = c == '-';
        if (c == '-' || c == '+') {
            c = scan();
        }
        for (; c >= '0' && c <= '9'; c = scan()) {
            val = (val << 3) + (val << 1) + (c & 15);
        }
        return neg ? -val : val;
    }
}