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.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.StringTokenizer;

public class Main
{

	public static void main(String[] args) throws IOException
	{

		Main main = new Main();
		main.read();
	}

	/* IO */
	private InputReader in;
	private StringBuilder ans;

	/* fields */
	private int nStrings;
	private int k;
	private String[] strs;
	private int nNodes;
	private Node[] nodes;
	private int currId;
	private boolean[] dpWin;
	private boolean[] solvedWin;
	private boolean[] dpLose;
	private boolean[] solvedLose;

	private void read() throws IOException
	{
		// streams
		boolean file = false;
		if (file)
			in = new InputReader(new FileInputStream("Input.txt"));
		else
			in = new InputReader(System.in);
		ans = new StringBuilder();

		// read
		nStrings = Integer.parseInt(in.next());
		k = Integer.parseInt(in.next());
		strs = new String[nStrings];
		nNodes = 1;
		for (int i = 0; i < nStrings; i++)
		{
			strs[i] = in.next().trim();
			nNodes += strs[i].length();
		}

		// solve
		System.out.println(solve());
	}

	private String solve()
	{
		// form trie
		nodes = new Node[nNodes];
		nodes[0] = new Node(0, '?');
		currId = 1;
		for (int i = 0; i < nStrings; i++)
			addString(strs[i]);

		// clear mem
		dpWin = new boolean[nNodes];
		solvedWin = new boolean[nNodes];
		boolean canWin = canWin(0);
		dpLose = new boolean[nNodes];
		solvedLose = new boolean[nNodes];
		boolean canLose = canLose(0);
		if (!canWin)
			return "Second";
		else if (canWin && canLose)
			return "First";
		else
			return k % 2 == 1 ? "First" : "Second";
	}

	private boolean canLose(int i)
	{
		// base case
		if (nodes[i].next.size() == 0)
			return true;
		if (solvedLose[i])
			return dpLose[i];

		// see if there's a move that loses the other
		boolean lose = false;
		for (Node next : nodes[i].next)
			lose |= !canLose(next.id);

		solvedLose[i] = true;
		return dpLose[i] = lose;
	}

	private boolean canWin(int i)
	{
		// base case
		if (nodes[i].next.size() == 0)
			return false;
		if (solvedWin[i])
			return dpWin[i];

		// see if there's a move that loses the other
		boolean win = false;
		for (Node next : nodes[i].next)
			win |= !canWin(next.id);

		solvedWin[i] = true;
		return dpWin[i] = win;
	}

	private void addString(String str)
	{
		Node curr = nodes[0];
		for (int i = 0; i < str.length(); i++)
		{
			// search for the next node
			char c = str.charAt(i);
			Node nextNode = null;
			for (Node next : curr.next)
			{
				if (next.c == c)
					nextNode = next;
			}

			// create a new one if not found
			if (nextNode == null)
			{
				Node newNode = new Node(currId, c);
				nodes[currId] = newNode;
				nextNode = newNode;
				curr.next.add(newNode);
				currId++;
			}
			curr = nextNode;
		}
	}

}

class Node
{
	int id;
	char c;
	LinkedList<Node> next;

	public Node(int id, char c)
	{
		this.id = id;
		this.c = c;
		this.next = new LinkedList<>();
	}

	public String toString()
	{
		return "" + c;
	}
}

class InputReader
{
	public BufferedReader reader;
	public StringTokenizer tokenizer;

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

	public String next()
	{
		while (tokenizer == null || !tokenizer.hasMoreTokens())
		{
			try
			{
				tokenizer = new StringTokenizer(reader.readLine());
			} catch (IOException e)
			{
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}

}