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.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Solution call = new Solution();
        call.run();
        
    }
    
    void run(){
        
        I r = new I();
        MyTrie T = new MyTrie();
        int n, m, i, j, k, p, q;
        n = r.in_i();
        k = r.in_i();
     //   String ar[] = new String[n];
        for(i=0;i<n;i++){
            String s= r.next();
            T.insert(s);
        }
        
        boolean l = IS_LOSE(T.root), w = IS_WIN(T.root);
        if(!w) System.out.print("Second");
        else if(l) System.out.print("First");
        else if(k%2 == 1) System.out.print("First");
        else System.out.print("Second");
        
    }
    
    boolean IS_LOSE(TrieNode rt){
        
        boolean res = true;
        int c = 0;
        for(int i=0; i<26; i++){
            if(rt.arr[i] != null){
                res = (res & IS_LOSE(rt.arr[i]));
                c++;
            }            
        }
        
        if( (!res) || c == 0 ) 
            return true;        
        else
            return false;                    
    }
    
    boolean IS_WIN(TrieNode rt){
        
        boolean res = false;
        int c = 0, i;
        for(i=0;i<26;i++){
            if(rt.arr[i] != null){
               res = (res | (!IS_WIN(rt.arr[i])));
            }
        }
        return res;
    }
}



class MyTrie{
	TrieNode root;
	
	MyTrie(){
		root = new TrieNode();
	}
	
	void insert(String x)
	{
		TrieNode curr = this.root;
		for(int it = 0; it < x.length(); it++){
			int v = x.charAt(it)-'a';
			if(curr.arr[v] == null){
				curr.arr[v] = new TrieNode();
			}
			
			curr = curr.arr[v];
		}
		curr.isLeaf = true;
	}
	
	boolean isPresent(String x){
		TrieNode curr= this.root;
		for(int it=0; it < x.length(); it++){
			int v = x.charAt(it)-'a';
			if(curr.arr[v] == null)
				return false;
			curr = curr.arr[v];
		}
		
		if(curr!=null && curr.isLeaf)
			return true;
		else 
			return false;
				
	}
}

class TrieNode{
	TrieNode arr[];	
	boolean isLeaf;
	
	TrieNode(){
		arr = new TrieNode[26];
		isLeaf = false;
	}	
}


// FAST INPUT

class I{
	private InputStream stream;
	private byte[] buf = new byte[1024];
	private int curChar;
	private int numChars;
	private SpaceCharFilter filter;
	
	public I() {
		this.stream = System.in;
	}
	
	public int read() {
		if (numChars == -1) {
			throw new InputMismatchException();
		}
		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0) {
				return -1;
			}
		}
		return buf[curChar++];
	}
	
	public int in_i() {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9') {
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}
	
	public String readString() {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isSpaceChar(c));
		return res.toString();
	}
	
	public double in_d() {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		double res = 0;
		while (!isSpaceChar(c) && c != '.') {
			if (c == 'e' || c == 'E') {
				return res * Math.pow(10, in_i());
			}
			if (c < '0' || c > '9') {
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		}
		if (c == '.') {
			c = read();
			double m = 1;
			while (!isSpaceChar(c)) {
				if (c == 'e' || c == 'E') {
					return res * Math.pow(10, in_i());
				}
				if (c < '0' || c > '9') {
					throw new InputMismatchException();
				}
				m /= 10;
				res += (c - '0') * m;
				c = read();
			}
		}
		return res * sgn;
	}
	
	public long in_l() {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		long res = 0;
		do {
			if (c < '0' || c > '9') {
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}
	
	public boolean isSpaceChar(int c) {
		if (filter != null) {
			return filter.isSpaceChar(c);
		}
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}
	
	public String next() {
		return readString();
	}
	
	public interface SpaceCharFilter {
		public boolean isSpaceChar(int ch);
	}
}