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.InputStreamReader;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.StringTokenizer;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author Lokesh Khandelwal
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		OutputWriter out = new OutputWriter(outputStream);
		TaskB solver = new TaskB();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskB {
    public void solve(int testNumber, InputReader in, OutputWriter out) {
        int n = in.nextInt(), k = in.nextInt(), i;
        Trie root = new Trie();
        for(i=0;i<n;i++) {
            root.add(in.next().toCharArray());
        }
        root.dfs();
        String ans = "First";
        if(!root.canWin) {
            ans = "Second";    
        } else {
            if(!root.canLose && k % 2 == 0) {
                ans = "Second";
            }
        }
        out.printLine(ans);
    }
    static class Trie {
        static int gid;
        static final int ALPHABET_SIZE = 26;
        int id, cnt;
        boolean leaf;
        boolean canWin, canLose;
        Trie children[] = new Trie[ALPHABET_SIZE];
        public Trie() {
            leaf = true;
        }
        public void add(char string[]) {
            Trie cur = this;
            cur.cnt++;
            for(char c : string) {
                if(cur.children[c - 'a'] == null) {
                    cur.children[c - 'a'] = new Trie();
                    cur.children[c - 'a'].id = ++gid;
                    cur.leaf = false;
                }
                cur = cur.children[c - 'a'];
                cur.cnt++;
            }
        }
        public void dfs() {
            if(leaf) {
                canWin = false;
                canLose = true;
            } else {
                canLose = canWin = false;
                for(int i=0;i<ALPHABET_SIZE;i++) {
                    if(children[i] != null) {
                        children[i].dfs();
                        if(!children[i].canWin) {
                            canWin = true;
                        }
                        if(!children[i].canLose) {
                            canLose = true;
                        }
                    }
                }
            }
        }
    }
}

class InputReader
{
    BufferedReader in;
    StringTokenizer tokenizer=null;

    public InputReader(InputStream inputStream)
    {
        in=new BufferedReader(new InputStreamReader(inputStream));
    }
    public String next()
    {
        try{
            while (tokenizer==null||!tokenizer.hasMoreTokens())
            {
                tokenizer=new StringTokenizer(in.readLine());
            }
            return tokenizer.nextToken();
        }
        catch (IOException e)
        {
            return null;
        }
    }
    public int nextInt()
    {
        return Integer.parseInt(next());
    }
}

class OutputWriter {
	private final PrintWriter writer;

	public OutputWriter(OutputStream outputStream) {
		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
	}

	public OutputWriter(Writer writer) {
		this.writer = new PrintWriter(writer);
	}

	public void print(Object...objects) {
		for (int i = 0; i < objects.length; i++) {
			if (i != 0)
				writer.print(' ');
			writer.print(objects[i]);
		}
	}

	public void printLine(Object...objects) {
		print(objects);
		writer.println();
	}

	public void close() {
		writer.close();
	}
}

