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
/*
 *
 * @author Mukesh Singh
 *
 */

import java.io.*;
import java.util.*;
import java.text.DecimalFormat;
@SuppressWarnings("unchecked")
public class AB {	
	//solve test cases
	void solve() throws Exception {
		int n = in.nextInt();
		int k = in.nextInt();
		TreeNode tree = new TreeNode('$');
		for(int i = 0 ; i < n ; ++i){
			String st = in.nextToken();
			addWord(tree,st,0);
		}
		LinkedList<TreeNode> ls = new LinkedList<>();
		LinkedList<TreeNode> temp = new LinkedList<>();
		temp.add(tree);
		while(temp.size() > 0 ){
			TreeNode tt = temp.removeFirst();
			ls.addLast(tt);
			for(TreeNode t : tt.childs) if(t != null ) temp.addLast(t);
		}
		while(ls.size() > 0 ){
			TreeNode tt = ls.removeLast();
			boolean leaf = true ;
			for(TreeNode t : tt.childs) if(t != null ) leaf = false ;
			if(leaf){
				tt.win = false ; tt.loss = true ;
			}else{
				for(TreeNode t : tt.childs){
					if(t != null ){
						tt.win |= (!t.win);
						tt.loss |= (!t.loss);
					}
				}
			}
		}
		if( tree.win && tree.loss) System.out.println("First");
		else if(tree.win){
			if(k%2 == 0 ) System.out.println("Second");
			else System.out.println("First");
		}else System.out.println("Second");
	}
	void addWord(TreeNode node,  String st , int idx){
		if(idx == st.length()) return ;
		int child = st.charAt(idx)-'a';
		if(node.childs[child]==null){
			node.childs[child] = new TreeNode(st.charAt(idx));
			addWord(node.childs[child],st,idx+1);
		}else{
			addWord(node.childs[child],st,idx+1);
		}
	}
	class TreeNode{
		char ch ;
		TreeNode[] childs ;
		boolean win ; boolean loss ;
		TreeNode(char ch){
			this.ch = ch ; win = loss = false ;
			childs = new TreeNode[26];
		}
	}
	//@ main function
	public static void main(String[] args) throws Exception {
		new AB();
	}
	
	InputReader in;
	PrintStream out ;
	DecimalFormat df ;
	AB() {
		try {
			File defaultInput = new File("file.in");
			if (defaultInput.exists()) 
				in = new InputReader("file.in");
			else 
				in = new InputReader();
			defaultInput = new File("file.out");
			if (defaultInput.exists()) 
				out = new PrintStream(new FileOutputStream("file.out"));
			else
				out = new PrintStream(System.out);
			df = new DecimalFormat("######0.00");
			solve();
			out.close();
		} 
		catch (Exception e) {
			e.printStackTrace();
			System.exit(261);
		}
	}
	
	class InputReader {
		BufferedReader reader;
		StringTokenizer tokenizer;
		
		InputReader() {
			reader = new BufferedReader(new InputStreamReader(System.in));
		}
		
		InputReader(String fileName) throws FileNotFoundException {
			reader = new BufferedReader(new FileReader(new File(fileName)));
		}
		
		String readLine() throws IOException {
			return reader.readLine();
		}
		
		String nextToken() throws IOException {
			while (tokenizer == null || !tokenizer.hasMoreTokens())
				tokenizer = new StringTokenizer(readLine());
			return tokenizer.nextToken();
		}
		
		boolean hasMoreTokens() throws IOException {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				String s = readLine();
				if (s == null)
					return false;
				tokenizer = new StringTokenizer(s);
			}
			return true;
		}
		
		int nextInt() throws NumberFormatException, IOException {
			return Integer.parseInt(nextToken());
		}
		
		long nextLong() throws NumberFormatException, IOException {
			return Long.parseLong(nextToken());
		}
		
		double nextDouble() throws NumberFormatException, IOException {
			return Double.parseDouble(nextToken());
		}
	}
}
