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 ALotOfGames {
    public static InputReader in;
    public static PrintWriter out;

    public static final int MOD = (int) (1e9 + 7);

    public static void main(String[] args) {
	in = new InputReader(System.in);
	out = new PrintWriter(System.out);
	
	int n = in.nextInt(), k = in.nextInt();
	
	TrieNode root = new TrieNode();
	for (int i = 0; i < n; i++) {
	    insertString(root, in.readString());
	}
	
	boolean win = false;
	for(TrieNode node : root.children) {
	    if(node == null) {
		continue;
	    }
	    win |= DFS1(node, 1);
	}
	
	boolean lose = false;
	for(TrieNode node : root.children) {
	    if(node == null) {
		continue;
	    }
	    lose |= DFS2(node, 1);
	}
	
	if(win && lose) {
	    out.println("First");
	} else if(win) {
	    out.println((k&1) == 1 ? "First" : "Second");
	} else {
	    out.println("Second");
	}
	

	out.close();
    }
    
    public static boolean DFS1(TrieNode curr, int level) {
	boolean result = (level&1) == 1;
	for(TrieNode next : curr.children) {
	    if(next == null) {
		continue;
	    }
	    if((level&1) == 1) {
		result &= DFS1(next, level + 1);
	    } else {
		result |= DFS1(next, level + 1);
	    }
	}
	return result;
    }
    
    public static boolean DFS2(TrieNode curr, int level) {
	boolean found = false;
	for(TrieNode next : curr.children) {
	    if(next == null) {
		continue;
	    }
	    found = true;
	}
	
	boolean result = found^((level&1) == 0);
	for(TrieNode next : curr.children) {
	    if(next == null) {
		continue;
	    }
	    if((level&1) == 1) {
		result &= DFS2(next, level + 1);
	    } else {
		result |= DFS2(next, level + 1);
	    }
	}
	return result;
    }
    
    public static class TrieNode {
        int count;
        boolean isLeaf;
        TrieNode[] children;
        
        public TrieNode() {
            this.count = 0;
            this.isLeaf = false;
            this.children = new TrieNode[26];
        }
    }

    public static void insertString(TrieNode root, String s) {
        TrieNode curr = root;
        for (char ch : s.toCharArray()) {
            int index = (int)ch - (int)'a';
            if(curr.children[index] == null)
                curr.children[index] = new TrieNode();
            curr = curr.children[index];
        }
        if(curr != null)
            curr.isLeaf = true;
    }

    static class Node implements Comparable<Node> {
	int next;
	int dist;

	public Node(int u, int v) {
	    this.next = u;
	    this.dist = v;
	}

	public void print() {
	    out.println(next + " " + dist + " ");
	}

	public int compareTo(Node that) {
	    return Integer.compare(this.next, that.next);
	}
    }

    static class InputReader {

	private InputStream stream;
	private byte[] buf = new byte[8192];
	private int curChar, snumChars;
	private SpaceCharFilter filter;

	public InputReader(InputStream stream) {
	    this.stream = stream;
	}

	public int snext() {
	    if (snumChars == -1)
		throw new InputMismatchException();
	    if (curChar >= snumChars) {
		curChar = 0;
		try {
		    snumChars = stream.read(buf);
		} catch (IOException e) {
		    throw new InputMismatchException();
		}
		if (snumChars <= 0)
		    return -1;
	    }
	    return buf[curChar++];
	}

	public int nextInt() {
	    int c = snext();
	    while (isSpaceChar(c))
		c = snext();
	    int sgn = 1;
	    if (c == '-') {
		sgn = -1;
		c = snext();
	    }
	    int res = 0;
	    do {
		if (c < '0' || c > '9')
		    throw new InputMismatchException();
		res *= 10;
		res += c - '0';
		c = snext();
	    } while (!isSpaceChar(c));
	    return res * sgn;
	}

	public long nextLong() {
	    int c = snext();
	    while (isSpaceChar(c))
		c = snext();
	    int sgn = 1;
	    if (c == '-') {
		sgn = -1;
		c = snext();
	    }
	    long res = 0;
	    do {
		if (c < '0' || c > '9')
		    throw new InputMismatchException();
		res *= 10;
		res += c - '0';
		c = snext();
	    } while (!isSpaceChar(c));
	    return res * sgn;
	}

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

	public String readString() {
	    int c = snext();
	    while (isSpaceChar(c))
		c = snext();
	    StringBuilder res = new StringBuilder();
	    do {
		res.appendCodePoint(c);
		c = snext();
	    } while (!isSpaceChar(c));
	    return res.toString();
	}

	public boolean isSpaceChar(int c) {
	    if (filter != null)
		return filter.isSpaceChar(c);
	    return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	public interface SpaceCharFilter {
	    public boolean isSpaceChar(int ch);
	}
    }
}
