CF455B.A Lot of Games

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

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.

输出格式

If the player who moves first wins, print "First", otherwise print "Second" (without the quotes).

输入输出样例

输入#1
```
2 3
a
b
```
输出#1
```
First
```
输入#2
```
3 1
a
b
c
```
输出#2
```
First
```
输入#3
```
1 2
ab
```
输出#3
```
Second
```

首页