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

public class C {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int n = sc.nextInt(), k = sc.nextInt();
		Trie t = new Trie();
		for (int i = 0; i < n; i++) {
			t.put(sc.next().toCharArray());
		}
		boolean canWin = t.canWin();
		boolean canLose = t.lose();
		boolean winFirst = false;
		if(canWin && !canLose)
			winFirst = k % 2 != 0;
		else if(!canWin)
			winFirst = false;
		else{
			winFirst = true;
		}
		out.println(winFirst? "First" : "Second");
		out.flush();
		out.close();
	}

	static class Trie {

		static final int R = 26;

		static class Node {
			Node[] next = new Node[R];
		}

		Node root = new Node();

		void put(char[] s) 
		{
			Node cur = root;
			for (char c : s) {
				Node nxt = cur.next[c - 'a'];
				if (nxt == null)
					nxt = cur.next[c - 'a'] = new Node();
				cur = nxt;
			}
		}

		boolean canWin() {
			return canWin(root);
		}

		boolean canWin(Node n) {
			for (int i = 0; i < n.next.length; i++) {
				if (n.next[i] != null && !canWin(n.next[i]))
					return true;
			}
			return false;
		}
		boolean lose(){
			return lose(root);
		}

		boolean lose(Node n) { // can find a way to force opp to lose
			boolean noleaf = false;
			for (int i = 0; i < n.next.length; i++) {
				noleaf |= n.next[i] != null;
				if (n.next[i] != null && mustWin(n.next[i])){
					return true;
				}
			}
			return noleaf?false:true;
		}

		boolean mustWin(Node n) { // all transitions are losing
			boolean b = false;
			for (int i = 0; i < n.next.length; i++) {
				b |= n.next[i] != null;
				if (n.next[i] != null && !lose(n.next[i])){
					return false;
				}
			}
			return b?true:false;
		}
	}

	static class Scanner {
		BufferedReader bf;
		StringTokenizer st;

		public Scanner(InputStream i) {
			bf = new BufferedReader(new InputStreamReader(i));

		}

		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(bf.readLine());
			return st.nextToken();
		}

		public int nextInt() throws NumberFormatException, IOException {
			return Integer.parseInt(next());
		}

		public double nextDouble() throws IOException {
			String x = next();
			StringBuilder sb = new StringBuilder("0");
			double res = 0, f = 1;
			boolean dec = false, neg = false;
			int start = 0;
			if (x.charAt(0) == '-') {
				neg = true;
				start++;
			}
			for (int i = start; i < x.length(); i++)
				if (x.charAt(i) == '.') {
					res = Long.parseLong(sb.toString());
					sb = new StringBuilder("0");
					dec = true;
				} else {
					sb.append(x.charAt(i));
					if (dec)
						f *= 10;
				}
			res += Long.parseLong(sb.toString()) / f;
			return res * (neg ? -1 : 1);
		}
	}
}