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 = '"""\nCodeforces Contest 260 Div 1 Problem B\n\nAuthor  : chaotic_iak\nLanguage: Python 3.3.4\n"""\n\ndef main():\n    n,k = read()\n    s = set()\n    for i in range(n): s.add(read(0))\n    s = list(s)\n    s.sort()\n    s = treeify(s)\n    res = solve(s)\n    if res == 0: # neither: second player win\n        print("Second")\n    if res == 1: # odd: first player win if k is odd\n        print("First" if k % 2 else "Second")\n    if res == 2: # even: second player win\n        print("Second")\n    if res == 3: # both: first player win\n        print("First")\n\ndef treeify(s):\n    res = [[] for _ in range(26)]\n    for i in s:\n        if i: res[ord(i[0]) - 97].append(i[1:])\n    fin = []\n    for i in range(26):\n        if res[i]: fin.append(treeify(res[i]))\n    return fin\n\ndef solve(s, parity=2):\n    for i in range(len(s)):\n        if isinstance(s[i], list): s[i] = solve(s[i], 3-parity)\n    if not s: return parity # no possible move: current parity\n    if 0 in s: return 3 # any neither: both\n    if 1 in s and 2 in s: return 3 # any odd and any even: both\n    if 1 in s: return 1 # any odd: odd\n    if 2 in s: return 2 # any even: even\n    return 0 # all both: neither\n\n################################### NON-SOLUTION STUFF BELOW\n\ndef read(mode=2):\n    # 0: String\n    # 1: List of strings\n    # 2: List of integers\n    inputs = input().strip()\n    if mode == 0: return inputs\n    if mode == 1: return inputs.split()\n    if mode == 2: return map(int, inputs.split())\n\ndef write(s="\\n"):\n    if isinstance(s, list): s = " ".join(map(str, s))\n    s = str(s)\n    print(s, end="")\n\nmain()'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14643