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

public class Main {
	public static void main(String[] args) {
		new Task().solve();
	}
}

class Task {
	InputReader in = new InputReader(System.in);
	PrintWriter out = new PrintWriter(System.out);

	Tire tire = new Tire() ;
	void solve() {
		tire.clear() ; 
		int n = in.nextInt() ;
		int	k = in.nextInt() ;
		while(n-- > 0) tire.add(in.next()) ;
		tire.dfs(0) ;
		if(tire.lose[0] == false && tire.win[0])
			out.println((k&1) > 0 ? "First":"Second");
		else if(tire.win[0] && tire.lose[0])
			out.println("First");
		else out.println("Second") ;
		out.flush() ;
	}
}

class Tire{
	final int nodeSize = 100000 + 8  ;  
	final int nodeSon = 26 ;
	int[][] next = new int[nodeSize][nodeSon] ;
	boolean[] isEnd = new boolean[nodeSize] ;
	int root ;
	int totel ;
	
	int newNode(){
		for(int i = 0 ; i < nodeSon ; i++){
			next[totel][i] = 0 ;
		}
		isEnd[totel] = false ;
		return totel++ ;
	}
	
	void clear(){
		totel = 0 ;
		root = newNode() ; 
	}
	
	void add(String word){
		int now = root ; 
		for(char c : word.toCharArray()){
			int i = c - 'a' ;
			if(next[now][i] == 0)
				next[now][i] = newNode() ;
			now = next[now][i] ;
		}
		isEnd[now] = true ;
	}

	boolean[] win = new boolean[nodeSize] ;
	boolean[] lose = new boolean[nodeSize] ;
	
	void dfs(int u){
		boolean isLeaf = true ;
		win[u] = lose[u] = false ;
		for(int i = 0 ; i < nodeSon ; i++){
			if(next[u][i] != 0){
				int v = next[u][i] ;
				isLeaf = false ;
				dfs(v) ;
				if(win[v] == false)
					win[u] = true ;
				if(lose[v] == false)
					lose[u] = true ;
			}
		}
		if(isLeaf){
			win[u] = false ;
			lose[u] = true ;
		}
	}
	
}

class InputReader {
	public BufferedReader reader;
	public StringTokenizer tokenizer;

	public InputReader(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream), 32768);
		tokenizer = new StringTokenizer("");
	}

	private void eat(String s) {
		tokenizer = new StringTokenizer(s);
	}

	public String nextLine() {
		try {
			return reader.readLine();
		} catch (Exception e) {
			return null;
		}
	}

	public boolean hasNext() {
		while (!tokenizer.hasMoreTokens()) {
			String s = nextLine();
			if (s == null)
				return false;
			eat(s);
		}
		return true;
	}

	public String next() {
		hasNext();
		return tokenizer.nextToken();
	}

	public int nextInt() {
		return Integer.parseInt(next());
	}

	public long nextLong() {
		return Long.parseLong(next());
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}

	public BigInteger nextBigInteger() {
		return new BigInteger(next());
	}

}
