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.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Round260_D {
	public static void main(String[] args) throws IOException{
		Reader.init(System.in);
		int n = Reader.nextInt();
		int k = Reader.nextInt();
		Trie trie = new Trie();
		for (int i = 0; i < n; i++) {
			String s = Reader.next();
			trie.insert(s);
		}
		trie.dfs(trie.root);
		if(!(trie.root.win)) {
			System.out.println("Second");
		}
		else if(trie.root.lose) {
			System.out.println("First");
		}
		else {
			if(k%2 == 1) {
				System.out.println("First");
			}
			else {
				System.out.println("Second");
			}
		}
	}
}
class Trie {
	TrieNode root;
	int count = 1;
	public Trie() {
		root = new TrieNode();
	}
	public void insert(String key) {
		int l = key.length();
		TrieNode root1 = root;
		root1.no_of_leaves+=1;
		for (int i = 0; i < l; i++) {
			int index = getIndex(key.charAt(i));
			if(root1.children[index]==null ) {
				root1.children[index] = new TrieNode();
				count+=1;
			}
			root1 = root1.children[index];
			root1.no_of_leaves+=1;
		}
		root1.end_of_word = true;
	}
	public boolean search(String key) {
		int l = key.length();
		TrieNode root1 = root;
		for (int i = 0; i < l; i++) {
			int index = getIndex(key.charAt(i));
			if(root1.children[index]==null ) {
				return false;
			}
			root1 = root1.children[index];
		}
		return root1.end_of_word;
	}
	public int search_prefix(String key) {
		int l = key.length();
		TrieNode root1 = root;
		for (int i = 0; i < l; i++) {
			int index = getIndex(key.charAt(i));
			if(root1.children[index]==null ) {
				return 0;
			}
			root1 = root1.children[index];
		}
		return root1.no_of_leaves;
	}
	public int getIndex(char c) {
		return c - 'a';
	}
	public void dfs(TrieNode root1) {
		root1.lose = false;
		root1.win = false;
		int flag = 0;
		for (int i = 0; i < 26; i++) {
			if(root1.children[i]!=null) {
				flag = 1;
				dfs(root1.children[i]);
				root1.lose |= !(root1.children[i].lose);
				root1.win |= !(root1.children[i].win);
			}
		}
		if(flag == 0) {
			root1.lose = true;
		}
	}
}
class TrieNode{
	TrieNode[] children;
	boolean end_of_word = false;
	int no_of_leaves = 0;
	boolean lose = false;
	boolean win = false;
	public TrieNode() {
		children = new TrieNode[26];
	}
}
class Reader {
static BufferedReader reader;
static StringTokenizer tokenizer;

/** call this method to initialize reader for InputStream */
static void init(InputStream input) {
reader = new BufferedReader(
             new InputStreamReader(input) );
tokenizer = new StringTokenizer("");
}

/** get next word */
static String next() throws IOException {
while ( ! tokenizer.hasMoreTokens() ) {
    //TODO add check for eof if necessary
    tokenizer = new StringTokenizer(
           reader.readLine() );
}
return tokenizer.nextToken();
}

static int nextInt() throws IOException {
return Integer.parseInt( next() );
}
static long nextLong() throws IOException {
	  return Long.parseLong( next() );
	}	
static double nextDouble() throws IOException {
return Double.parseDouble( next() );
}
}