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.*;
import java.util.*;

public class Main {

	public static class FastReader {
		BufferedReader br;
		StringTokenizer root;
		
 
		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
 
		String next() {
			while (root == null || !root.hasMoreTokens()) {
				try {
					root = new StringTokenizer(br.readLine());
				} catch (Exception addd) {
					addd.printStackTrace();
				}
			}
			return root.nextToken();
		}
 
		int nextInt() {
			return Integer.parseInt(next());
		}
 
		double nextDouble() {
			return Double.parseDouble(next());
		}
 
		long nextLong() {
			return Long.parseLong(next());
		}
 
		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (Exception addd) {
				addd.printStackTrace();
			}
			return str;
		}
	}
	
	public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));
	
	public static FastReader sc = new FastReader();
 
	static int mod = (int) (1e9+7),MAX=(int) (3e5);
	static List<Integer>[] edges ;
	static long[][] dp;
	public static void main(String[] args) {
	    int n = sc.nextInt();
	    int k = sc.nextInt();
	    Trie t = new Trie(n,k);
	    for(int i=0;i<n;++i) {
	    	String s = sc.next();
	    	t.addString(t.root,s,0);
	    }
		t.dfs(t.root);
		boolean win = t.root.canWin;
		boolean loose = t.root.canLose;
		if(win == false) out.print("Second");
		else {
			// both option are available then we can choose accordingly
			if(win && loose) out.print("First"); 
			// else we can only WIN then we have to check parity of k
			// as player who loses will play next and surely win 
			else if(win && !loose) {
				if((k&1) == 1) out.println("First");
				else out.println("Second");
			}
		}
		
		out.close();
	}
static class TNode{
		
		boolean canWin=false;
		boolean canLose=false;
		
		TNode[] child = new TNode[26];
		
	}
static class Trie{
	
	int n;
	int k;
	TNode root;
	Trie(int n,int k) {
		this.n = n;
		this.k = k;
		root = new TNode();
	}
	
	void addString(TNode curNode, String str, int ind){
		if (ind<str.length()){
			int numChild = (int)str.charAt(ind)-(int)'a';
			if (curNode.child[numChild]==null)
				curNode.child[numChild]=new TNode();
			
			addString(curNode.child[numChild],str,ind+1);
		}
	}
	
	boolean isLeaf(TNode curNode){
		if (curNode == null)
			return true;
		
		for (int i=0; i<26; i++){
			if (curNode.child[i]!=null)
				return false;
		}
		return true;
	}
	
	void dfs(TNode curNode){
		boolean isLeaf = isLeaf(curNode);
		if (isLeaf){
			curNode.canWin=false;
			curNode.canLose=true;
		} else {
			for (int i=0; i<26; i++){
				if (curNode.child[i]!=null){
					dfs(curNode.child[i]);
					curNode.canWin=(curNode.canWin || (!curNode.child[i].canWin));
					curNode.canLose=(curNode.canLose || (!curNode.child[i].canLose));
				}
			}
		}
	}
}
}
