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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.ArrayList;
import java.util.List;

public class Main {
    public static void main(String[] args) {
        try (BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) {
            String[] numbers = reader.readLine().trim().split(" ");
            int amountOfWords = Integer.parseInt(numbers[0]);
            int numberOfGames = Integer.parseInt(numbers[1]);
            String[] words = new String[amountOfWords];
            for (int i = 0; i < amountOfWords; i++) {
                words[i] = reader.readLine().trim();
            }
            Main solution = new Main(words, numberOfGames);
            System.out.println(solution.getWinner());
        } catch (IOException e) {
            e.printStackTrace();
        }
    }
    
    private String[] words;
    private int numberOfGames;
    
    public Main(String[] words, int numberOfGames) {
        this.words = words;
        this.numberOfGames = numberOfGames;
    }
    
    public String getWinner() {
        String player1 = "First";
        String player2 = "Second";
        Trie trie = new Trie();
        char last = ' ';
        for (String word : words) {
            char firstLetter = word.charAt(0);
            trie.insert(word);
        }
        boolean firstCanWinGame = trie.firstCanWinGame();
        boolean firstCanLooseGame = trie.firstCanLooseGame();
        /*if (numberOfGames == 54533605) {
            StringBuilder builder = new StringBuilder();
            int count = 0;
            for (Trie.Node node : trie.root.nextNodes) {
                if (node != null) {
                    count++;
                    System.out.println(count + " " + node.letter + " " + node.winIfChoose);
                }
            }
            System.out.println(count);
        }*/
        if (firstCanWinGame && firstCanLooseGame) {
            return player1;
        }
        if (!firstCanWinGame) {
            return player2;
        }
        if (numberOfGames % 2 == 0) {
            return player2;
        }
        return player1;
    }
}

class Trie {
    public static final int LATIN_LETTERS = 26;
    Node root;
    
    public Trie() {
        this.root = new Node(' ');
    }
    
    public boolean firstCanWinGame() {
        for (Node node : root.nextNodes) {
            if (node != null && node.winIfChoose) {
                return true;
            }
        }
        return false;
    }
    
    public boolean firstCanLooseGame() {
        for (Node node : root.nextNodes) {
            if (node != null && node.looseIfChoose) {
                return true;
            }
        }
        return false;
    }
    
    public void printWords(Node node, StringBuilder builder) {
        builder.append(node.letter);
        if (node.nonEmptyNodes.isEmpty()) {
            System.out.println(builder.toString());
            if (builder.length() > 0) {
                builder.setLength(builder.length() - 1);
            }
            return;
        }
        
        for (Node nextNode : node.nextNodes) {
            if (nextNode != null) {
                printWords(nextNode, builder);
            }
        }
        if (builder.length() > 0) {
            builder.setLength(builder.length() - 1);
        }
    }
    
    public void insert(String word) {
        insert(root, word, 0);
    }
    
    private void insert(Node node, String word, int position) {
        if (position >= word.length()) {
            return;
        }
        char currentLetter = word.charAt(position);
        Node nextNode = node.nextNodes[getLetterHash(currentLetter)];
        if (nextNode == null) {
            nextNode = new Node(currentLetter);
            node.nonEmptyNodes.add(nextNode);
            node.nextNodes[getLetterHash(currentLetter)] = nextNode;
        }
        insert(nextNode, word, position + 1);
        node.winIfChoose &= !nextNode.winIfChoose;
        node.looseIfChoose = true;
        for (Node nextNonEmptyNode : node.nonEmptyNodes) {
            node.looseIfChoose &= !nextNonEmptyNode.looseIfChoose;
        }
    }
    
    private int getLetterHash(char letter) {
        return letter - 'a';
    }
    
    static class Node {
        boolean winIfChoose;
        boolean looseIfChoose;
        char letter;
        Node[] nextNodes;
        List<Node> nonEmptyNodes;
        
        private Node(char letter) {
            this.letter = letter;
            nonEmptyNodes = new ArrayList<>();
            nextNodes = new Node[LATIN_LETTERS];
            winIfChoose = true;
            looseIfChoose = false;
        }
    }
}