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.IOException;
import java.util.HashMap;
import java.util.Map;

public class B {

	private static final int IN_BUFFER_SIZE = 1 << 16;
	private static final int OUT_BUFFER_SIZE = 1 << 16;
	private byte[] input = new byte[IN_BUFFER_SIZE];
	private int ix = IN_BUFFER_SIZE;
	private int bytesRead = ix;
	private byte[] output = new byte[OUT_BUFFER_SIZE];
	private int ox = 0;

	private void readMore() {
		try {
			bytesRead = System.in.read(input, 0, IN_BUFFER_SIZE);
			if (bytesRead <= 0)
				throw new RuntimeException();
			ix = 0;
		} catch (IOException e) {
			throw new RuntimeException();
		}
	}

	private void flushOut() {
		System.out.write(output, 0, ox);
		ox = 0;
	}

	private void append(String s) {
		char[] ca = s.toCharArray();
		for (int i = 0; i < ca.length; i++) {
			append(ca[i]);
		}
	}

	private void append(char c) {
		if (ox == OUT_BUFFER_SIZE)
			flushOut();
		output[ox++] = (byte) c;
	}

	private int nextInt() {
		skipSpaces();
		int ret = 0;
		if (ix == bytesRead) {
			readMore();
		}
		int sign = 1;
		if (input[ix] == '-') {
			sign = -1;
			ix++;
		}
		while (true) {
			if (ix == bytesRead) {
				try {
					readMore();
				} catch (RuntimeException e) {
					return ret;
				}
			}
			if (input[ix] < '0') {
				break;
			}
			ret *= 10;
			ret += input[ix++] - '0';
		}
		return sign * ret;
	}

	private int charArrayLength;

	private void nextCharArray(char[] ca) {
		skipSpaces();
		if (ix == bytesRead) {
			readMore();
		}
		charArrayLength = 0;
		ca[charArrayLength++] = (char) input[ix++];
		while (true) {
			if (ix == bytesRead) {
				try {
					readMore();
				} catch (RuntimeException e) {
					return;
				}
			}
			char c = (char) input[ix++];
			if (c < '0')
				break;
			ca[charArrayLength++] = c;
		}
	}

	private void skipSpaces() {
		while (true) {
			if (ix == bytesRead) {
				readMore();
			}
			if (input[ix] > ' ')
				break;
			ix++;
		}
	}

	public static void main(String[] args) throws IOException {
		new B().work();
	}

	class Node {
		int hash;
		char c;
		Node parent;
		Map<Character, Node> children;
		Boolean odd, even;

		Node(char c, Node parent) {
			this.c = c;
			this.parent = parent;
			children = new HashMap<>();
		}

		void setOddEven() {
			if (children.isEmpty()) {
				odd = true;
				even = false;
			} else {
				for (Node child : children.values()) {
					child.setOddEven();
					if (child.odd) {
						even = true;
					}
					if (child.even) {
						odd = true;
					}
				}
				if (odd == null)
					odd = false;
				if (even == null)
					even = false;
			}
		}

		public int hashCode() {
			if (hash == 0)
				hash = 31 * c + ((parent == null) ? -1 : parent.hashCode());
			return hash;
		}

		public boolean equals(Object o) {
			Node n = (Node) o;
			if (parent == null) {
				if (n.parent != null)
					return false;
			} else {
				if (n.parent == null)
					return false;
			}
			return c == n.c && parent.equals(n.parent);
		}

		public String toString() {
			return String.format("%c %b %b", c, odd, even);
		}
	}

	private void work() {
		char[] w = new char[100010];
		int n = nextInt();
		int k = nextInt();
		Node root = new Node('\0', null);
		while (n-- > 0) {
			nextCharArray(w);
			Node cur = root;
			for (int i = 0; i < charArrayLength; i++) {
				if (!cur.children.containsKey(w[i])) {
					Node child = new Node(w[i], cur);
					cur.children.put(w[i], child);
				}
				cur = cur.children.get(w[i]);
			}
		}
		root.setOddEven();
		// print(root, "");

		memo.clear();
		boolean win = false;
		for (Node topNode : root.children.values()) {
			if (canWin(topNode)) {
				win = true;
				break;
			}
		}

		// System.out.println(memo);

		memo.clear();
		boolean loss = false;
		for (Node topNode : root.children.values()) {
			if (canLose(topNode)) {
				loss = true;
				break;
			}
		}

		boolean fst = ((k & 1) == 0) ? (win && loss) : win;
		append(fst ? "First\n" : "Second\n");

		if (ox > 0)
			flushOut();
		System.out.close();
	}

	private void print(Node n, String s) {
		append(s);
		append(n.toString());
		append('\n');
		for (Node child : n.children.values()) {
			print(child, s + " ");
		}
	}

	private Map<Node, Boolean> memo = new HashMap<>();

	private boolean canWin(Node node) {
		// System.out.println(node);
		if (memo.containsKey(node)) {
			return memo.get(node);
		}
		boolean ret;
		if (node.odd ^ node.even) {
			ret = node.odd;
		} else {
			ret = true;
			for (Node child : node.children.values()) {
				if (canWin(child)) {
					ret = false;
					break;
				}
			}
		}
		memo.put(node, ret);
		return ret;
	}

	private boolean canLose(Node node) {
		if (memo.containsKey(node)) {
			return memo.get(node);
		}
		boolean ret;
		if (node.even ^ node.odd) {
			ret = node.even;
		} else {
			ret = true;
			for (Node child : node.children.values()) {
				if (canLose(child)) {
					ret = false;
					break;
				}
			}
		}
		memo.put(node, ret);
		return ret;
	}
}
