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.BufferedInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;

public class B455 {
	
	final int ALP = 26;
	final int N = (int) 1e5 + 20;
	
	int[][] trie;
	int node = 1;
	int n, k;
	
	void insert(String s) {
		int cur = 0;
		for(char i : s.toCharArray()) {
			int c = i - 'a';
			if(trie[c][cur] == -1) trie[c][cur] = node++;
			int next = trie[c][cur];
			cur = next;
		}
	}
	
	Boolean[] win, lose;
	
	boolean dpw(int node) {
		if(node == N) return false;
		if(win[node] != null) return win[node];
		boolean ans = false;
		for(char c = 0; c < 26; ++c) {
			if(trie[c][node] == -1) continue;
			ans |= !dpw(trie[c][node]);
			if(ans) break;
		}
		return win[node] = ans;
	}
	
	boolean dpl(int node) {
		if(node == N) return true;
		if(lose[node] != null) return lose[node];
		boolean allBad = true;
		boolean ans = false;
		for(char c = 0; c < 26; ++c) {
			if(trie[c][node] == -1) continue;
			allBad = false;
			ans |= !dpl(trie[c][node]);
			if(ans) break;
		}
		if(allBad) ans = true;
		return lose[node] = ans;
	}
	
	public void solve(JS in, PrintWriter out) {
		n = in.nextInt();
		k = in.nextInt();
		trie = new int[ALP][N];
		for(int[] a : trie) Arrays.fill(a, -1);
		for(int i = 0; i < n; ++i) insert(in.next());
		win = new Boolean[N];
		lose = new Boolean[N];
		boolean forceWin = dpw(0);
		boolean forceLose = dpl(0);
		if(forceWin && forceLose) {
			out.println("First");
		} else {
			if(forceWin) {
				out.println(k % 2 == 1 ? "First" : "Second");
			} else {
				out.println("Second");
			}
		}
	}
	
	public static void main(String[] args) {
		JS in = new JS();
		PrintWriter out = new PrintWriter(System.out);
		new B455().solve(in, out);
		out.close();
	}
	
	static class JS{
		public int BS = 1<<16;
		public char NC = (char)0;
		byte[] buf = new byte[BS];
		int bId = 0, size = 0;
		char c = NC;
		double num = 1;
		BufferedInputStream in;
		
		public JS() {
			in = new BufferedInputStream(System.in, BS);
		}
		
		public JS(String s) throws FileNotFoundException {
			in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
		}
		
		public char nextChar(){
			while(bId==size) {
				try {
					size = in.read(buf);
				}catch(Exception e) {
					return NC;
				}				
				if(size==-1)return NC;
				bId=0;
			}
			return (char)buf[bId++];
		}
		
		public int nextInt() {
			return (int)nextLong();
		}
		
		public long nextLong() {
			num=1;
			boolean neg = false;
			if(c==NC)c=nextChar();
			for(;(c<'0' || c>'9'); c = nextChar()) {
				if(c=='-')neg=true;
			}
			long res = 0;
			for(; c>='0' && c <='9'; c=nextChar()) {
				res = (res<<3)+(res<<1)+c-'0';
				num*=10;
			}
			return neg?-res:res;
		}
		
		public double nextDouble() {
		    while(c!='.'&&c!='-'&&(c <'0' || c>'9')) c = nextChar();
		    boolean neg = c=='-';
		    if(neg)c=nextChar();
		    boolean fl = c=='.';
		    double cur = nextLong();
		    if(fl) return neg ? -cur/num : cur/num;
		    if(c == '.') {
			double next = nextLong();
			return neg ? -cur-next/num : cur+next/num;
		    }
		    else return neg ? -cur : cur;
		}
		
		public String next() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c>32) {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}
		
		public String nextLine() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c!='\n') {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}

		public boolean hasNext() {
			if(c>32)return true;
			while(true) {
				c=nextChar();
				if(c==NC)return false;
				else if(c>32)return true;
			}
		}
	}
}
