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 ≤ 10^5; 1 ≤ k ≤ 10^9).

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 10^5. 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

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'import math\nimport sys\nfrom itertools import permutations\ninput = sys.stdin.readline\n\n\nclass Node:\n\n    def __init__(self):\n        self.children = [None]*26\n        self.isEnd = False\n        self.win = False\n        self.lose = False\n\nclass Trie:\n\n    def __init__(self):\n        self.root = Node()\n\n    def insert(self, key):\n        cur = self.root\n        for i in range(len(key)):\n            if cur.children[ord(key[i])-ord(\'a\')]==None:\n                cur.children[ord(key[i])-ord(\'a\')]=Node()\n            cur = cur.children[ord(key[i])-ord(\'a\')]\n        \n        cur.isEnd = True\n    \n    def search(self, key):\n        cur = self.root\n        for i in range(len(key)):\n            if cur.children[ord(key[i])-ord(\'a\')]==None:\n                return False\n            cur = cur.children[ord(key[i])-ord(\'a\')]\n        \n        if cur!=None and cur.isEnd:\n            return True\n\n        return False\n    \n    def assignWin(self, cur):\n        \n        flag = True\n        for i in range(26):\n            if cur.children[i]!=None:\n                flag=False\n                self.assignWin(cur.children[i])\n        \n        if flag:\n            cur.win=False\n            cur.lose=True\n        else:\n            for i in range(26):\n                if cur.children[i]!=None:\n                    cur.win = cur.win or (not cur.children[i].win)\n                    cur.lose = cur.lose or (not cur.children[i].lose)\n       \n\ndef __starting_point():\n    \n    t=Trie()\n\n    n,k=list(map(int,input().split()))\n    for i in range(n):\n        s=input()\n        if s[-1]=="\\n":\n            s= s[:-1]\n        t.insert(s)\n    \n    t.assignWin(t.root)\n    \n    if not t.root.win:\n        print("Second")\n    else:\n        if t.root.lose:\n            print("First")\n        else:\n            if k%2==1:\n                print("First")\n            else:\n                print("Second")\n\n__starting_point()'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 20713