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 final class lot_of_games
{
    static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	static FastScanner sc=new FastScanner(br);
    static PrintWriter out=new PrintWriter(System.out);
	static TrieNode root=new TrieNode();
	
	static void insert(char[] a)
	{
		TrieNode curr_node=root;	
		for(char ch:a)
		{
			TrieNode child=curr_node.children[ch-'a'];
			if(child==null)
			{
				child=curr_node.children[ch-'a']=new TrieNode();
			}
			curr_node=child;
		}
	}
	
	static int solve(TrieNode curr_node,int last)
	{
		int now=last;
		for(char i=0;i<26;i++)	
		{
			if(curr_node.children[i]!=null)
			{
				int curr=solve(curr_node.children[i],1-last);
				now=((now==1-last || curr==1-last)?1-last:last);
			}
		}
		return now;
	}
	
	static int check(TrieNode curr_node,int last)
	{
		boolean pick=false;
		for(int i=0;i<26;i++)
		{
			if(curr_node.children[i]!=null)
			{
				pick=true;
				if(check(curr_node.children[i],1-last)==last)
				{
					return last;
				}
			}
		}
		if(!pick)
		{
			return last;
		}
		return 1-last;
	}
	
    public static void main(String args[]) throws Exception
    {
		int n=sc.nextInt(),k=sc.nextInt();
		for(int i=0;i<n;i++)
		{
			char[] a=sc.next().toCharArray();insert(a);
		}
		int win=solve(root,1);
		if(win==1)
		{
			out.println("Second");
		}
		else if(k==1)
		{
			out.println("First");
		}
		else
		{
			if(check(root,1)==1)
			{
				out.println("First");
			}
			else
			{
				out.println(k%2==1?"First":"Second");
			}
		}
		out.close();
    }
}
class TrieNode
{
	TrieNode[] children=new TrieNode[26];
}
class FastScanner
{
    BufferedReader in;
    StringTokenizer st;

    public FastScanner(BufferedReader in) {
        this.in = in;
    }
	
    public String nextToken() throws Exception {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
	
	public String next() throws Exception {
		return nextToken().toString();
	}
	
    public int nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }

    public long nextLong() throws Exception {
        return Long.parseLong(nextToken());
    }

    public double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
}