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

public class Main{
    final boolean isFileIO = false; 
    BufferedReader in;
    PrintWriter out;
    StringTokenizer st = new StringTokenizer("");
    String delim = " ";

    public static void main(String[] args) throws IOException {
        Main m = new Main();
        m.initIO();
        m.solve();
        m.in.close();
        m.out.close();
    }

    public void initIO() throws IOException {
        if(!isFileIO) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            in = new BufferedReader(new FileReader("input.txt"));
            out = new PrintWriter("output.txt"); 
        }
    }
  
    String nextToken() throws IOException {
        if(!st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken(delim);
    }
 
    String readLine() throws IOException {
        return in.readLine();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
    

    class Trie {
        public HashMap<Character, Integer> to = new HashMap<Character, Integer>();
        public void add(String s) {
            int cur = 0;
            for(int i = 0 ; i < s.length(); i++) {
                if(trie[cur].to.containsKey(s.charAt(i))) {
                    cur = trie[cur].to.get(s.charAt(i));
                }
                else {
                        trie[cur].to.put(s.charAt(i), ++size);
                        cur = size;
                    }
            }
        }
        
    }
    int size = 0;
    int max = 100005;
    Trie[] trie = new Trie[max];
    boolean[] win = new boolean[max];
    boolean[] lose = new boolean[max];

    public void dfs(boolean flag, int cur) {
        if(!flag && !trie[cur].to.isEmpty()) {
            win[cur] = true;
            lose[cur] = true;
        }
        if(trie[cur].to.isEmpty()) {
            if(!flag) {
                win[cur] = true;
                lose[cur] = false;
            } else {
                win[cur]= false;
                lose[cur] = true;
            }
        }
        for(Character key : trie[cur].to.keySet()) {
            dfs(!flag, trie[cur].to.get(key));
        }
        for(Character key : trie[cur].to.keySet()) {
            int next = trie[cur].to.get(key);
            if(flag) {
                win[cur] |= win[next];
                lose[cur] |= lose[next];
            } else {
                win[cur] &= win[next];
                lose[cur] &= lose[next];   
            }
        }
    }
    
    void solve() throws IOException {
        int n, k;
        n = nextInt(); k = nextInt();
        for(int i = 0; i < max; i++)
            trie[i] = new Trie();
        for(int i = 0; i < n; i++) {
            String s = readLine();
            trie[0].add(s);
        }
        dfs(true, 0);
        if(!win[0]) {
            out.println("Second");
        } else {
            if(win[0] && lose[0]) {
                out.println("First");
            } else {
                if(k % 2 == 0)
                    out.println("Second");
                else
                    out.println("First");
            }
        }
    }
}
