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.util.*;
import java.io.*;

public class D_456 {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		PrintWriter pw = new PrintWriter(System.out);
		
		int n = sc.nextInt(), k = sc.nextInt();
		Trie set = new Trie();
		
		for(int i = 0; i < n; i++)
			set.add(sc.next());
		
		set.canWin(set.head, 1);
		boolean win = set.head.win;
		
		set.canLose(set.head, 1);
		boolean lose = !set.head.win;
		
		if(win & lose) {
			pw.println("First");
		} else if(win) {
			pw.println(k % 2 == 1 ? "First" : "Second");
		} else {
			pw.println("Second");
		}
		
		pw.flush();
	}
	
	public static class Trie {
		
		public static class Node {
			boolean win;
			Node[] array;
			
			public Node() {
				array = new Node[26];
			}
		}
		
		Node head;
		
		public Trie() {
			head = new Node();
		}
		
		public void add(String s) {
			add(head, s, 0);
		}
		
		public void add(Node curr, String s, int i) {
			if(i == s.length())
				return;
			
			int j = s.charAt(i) - 'a';
			if(curr.array[j] == null)
				curr.array[j] = new Node();
			add(curr.array[j], s, i + 1);
		}
		
		public void canWin(Node curr, int pos) {
			int cntAll = 0, cntWin = 0, cntLose = 0;
			for(int i = 0; i < 26; i++)
				if(curr.array[i] != null) {
					canWin(curr.array[i], pos + 1);
					cntAll++;
					if(curr.array[i].win)
						cntWin++;
					else
						cntLose++;
				}
			
			if(pos % 2 == 1) {
				if(cntAll == 0)
					curr.win = false;
				else if(cntWin > 0)
					curr.win = true;
				else
					curr.win = false;
			} else {
				if(cntAll == 0)
					curr.win = true;
				else if(cntLose > 0)
					curr.win = false;
				else
					curr.win = true;
			}
		}
		
		public void canLose(Node curr, int pos) {
			int cntAll = 0, cntWin = 0, cntLose = 0;
			for(int i = 0; i < 26; i++)
				if(curr.array[i] != null) {
					canLose(curr.array[i], pos + 1);
					cntAll++;
					if(curr.array[i].win)
						cntWin++;
					else
						cntLose++;
				}
			
			if(pos % 2 == 1) {
				if(cntAll == 0)
					curr.win = false;
				else if(cntLose > 0)
					curr.win = false;
				else
					curr.win = true;
			} else {
				if(cntAll == 0)
					curr.win = true;
				else if(cntWin > 0)
					curr.win = true;
				else
					curr.win = false;
			}
		}
	}

	public static class Scanner {
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}

		public Scanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}

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

		public String nextLine() throws IOException {
			return br.readLine();
		}

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

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

		public char nextChar() throws IOException {
			return next().charAt(0);
		}

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

		public int[] nextIntArray(int n) throws IOException {
			int[] array = new int[n];
			for (int i = 0; i < n; i++)
				array[i] = nextInt();
			return array;
		}

		public Integer[] nextIntegerArray(int n) throws IOException {
			Integer[] array = new Integer[n];
			for (int i = 0; i < n; i++)
				array[i] = new Integer(nextInt());
			return array;
		}

		public long[] nextLongArray(int n) throws IOException {
			long[] array = new long[n];
			for (int i = 0; i < n; i++)
				array[i] = nextLong();
			return array;
		}

		public double[] nextDoubleArray(int n) throws IOException {
			double[] array = new double[n];
			for (int i = 0; i < n; i++)
				array[i] = nextDouble();
			return array;
		}

		public static int[] shuffle(int[] a) {
			int n = a.length;
			Random rand = new Random();
			for (int i = 0; i < n; i++) {
				int tmpIdx = rand.nextInt(n);
				int tmp = a[i];
				a[i] = a[tmpIdx];
				a[tmpIdx] = tmp;
			}
			return a;
		}

		public boolean ready() throws IOException {
			return br.ready();
		}

		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	}
}
