human
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
# htt Write me a Python code to fix of at least one string from the group?
assistant
#Here is Python code to fix of at least one string from the group.
ps://codeforces.com/contest/455/problem/B
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__

class Trie:

    def __init__(self):
        self.arr = {}

    def insert(self, word):
        for x in word:
            if x not in self.arr:
                self.arr[x] = Trie()
            self = self.arr[x]

    def dfs(self):
        if not len(self.arr):
            return False, True
        win, lose = False, False
        for x in self.arr:
            w, l = self.arr[x].dfs()
            win = win or not w
            lose = lose or not l
        return win, lose

def answer(flag):
    print("First" if flag else "Second")

T = Trie()
n, k = map(int, input().split())
for _ in range(n):
    T.insert(input())
win, lose = T.dfs()

if k == 1 or (not win) or lose or k&1:
    answer(win)
else:
    answer(not win)