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

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);
        TaskB solver = new TaskB();
        solver.solve(1,in,out);
        out.close();
    }
}

class TaskB{

    static int N = 100010;
    int trie[][],n,k;
    boolean win[],lose[];
    int at;

    void add( String s ){
        int no = 0;
        for(int i=0;i<s.length();++i){
            int pos = s.charAt(i)-'a';
            if(trie[no][pos]==0) trie[no][pos] = at++;
            no = trie[no][pos];
        }
    }

    void dfs( int x )
    {
        int f = 0;
        win[x] = false;
        lose[x] = false;
        for(int i=0;i<26;++i)
        {
            if(trie[x][i]==0) continue;
            int y = trie[x][i];
            dfs(y);
            win[x] |= !win[y];
            lose[x] |= !lose[y];
            f = 1;
        }
        if(f==0) lose[x] = true;
    }

    void answer(boolean res)
    {
        if(res) System.out.println("First");
        else System.out.println("Second");
    }

    public void solve(int testNumber, InputReader in, PrintWriter out){
        
        trie = new int[N][27];
        win = new boolean[N*10];
        lose = new boolean[N*10];

        at = 1;
        n = in.nextInt();
        k = in.nextInt();

        for(int i=0;i<n;++i){
            String s = in.next();
            add(s);
        }

        dfs(0);
        if (k == 1) answer(win[0]); //1 game
        else if (!win[0]) answer(win[0]); //answer(0);
        else if (lose[0]) answer(win[0]); //answer(1);
        else if (k % 2 == 1) answer(win[0]); //answer(1)
        else answer(!win[0]); //answer(0)
    }
}




























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