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

public class A implements Runnable {

    private static final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;

    private BufferedReader in;
    private PrintWriter out;
    private StringTokenizer tok = new StringTokenizer("");

    private void init() throws FileNotFoundException {
        Locale.setDefault(Locale.US);
        String fileName = "";
        if (ONLINE_JUDGE && fileName.isEmpty()) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            if (fileName.isEmpty()) {
                in = new BufferedReader(new FileReader("input.txt"));
                out = new PrintWriter("output.txt");
            } else {
                in = new BufferedReader(new FileReader(fileName + ".in"));
                out = new PrintWriter(fileName + ".out");
            }
        }
    }

    String readString() {
        while (!tok.hasMoreTokens()) {
            try {
                tok = new StringTokenizer(in.readLine());
            } catch (Exception e) {
                return null;
            }
        }
        return tok.nextToken();
    }

    int readInt() {
        return Integer.parseInt(readString());
    }

    long readLong() {
        return Long.parseLong(readString());
    }

    double readDouble() {
        return Double.parseDouble(readString());
    }

    int[] readIntArray(int size) {
        int[] a = new int[size];
        for (int i = 0; i < size; i++) {
            a[i] = readInt();
        }
        return a;
    }

    public static void main(String[] args) {
        //new Thread(null, new _Solution(), "", 128 * (1L << 20)).start();
        new A().run();
    }

    long timeBegin, timeEnd;

    void time() {
        timeEnd = System.currentTimeMillis();
        System.err.println("Time = " + (timeEnd - timeBegin));
    }

    @Override
    public void run() {
        try {
            timeBegin = System.currentTimeMillis();
            init();
            solve();
            out.close();
            time();
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(-1);
        }
    }

    final int ALPHABET_SIZE = 26;

    class Node {
        Node[] chars = new Node[ALPHABET_SIZE];
    }

    Node root = new Node();

    void add(char[] s) {
        Node cur = root;
        for (int i = 0; i < s.length; i++) {
            s[i] -= 'a';
            if (cur.chars[s[i]] == null) {
                cur.chars[s[i]] = new Node();
            }
            cur = cur.chars[s[i]];
        }
    }

    boolean canWin(Node cur) {
        boolean win = false;
        for (int i = 0; i < cur.chars.length; i++) {
            if (cur.chars[i] != null) {
                win |= !canWin(cur.chars[i]);
            }
        }
        return win;
    }

    boolean canLose(Node cur) {
        boolean loose = false;
        boolean hasLeafs = false;
        for (int i = 0; i < cur.chars.length; i++) {
            if (cur.chars[i] != null) {
                hasLeafs = true;
                loose |= !canLose(cur.chars[i]);
            }
        }
        return !hasLeafs || loose;
    }

    private void solve() {
        int n = readInt();
        int k = readInt();

        for (int i = 0; i < n; i++) {
            add(readString().toCharArray());
        }

        boolean canWin = canWin(root);
        boolean canLose = canLose(root);

        //out.println(canWin + " " + canLose)

        if (canWin && canLose) {
            out.println("First");
        } else if (!canWin && !canLose) {
            out.println("Second");
        } else if (!canLose) {
            out.println(k % 2 == 0 ? "Second" : "First");
        } else {
            out.println("Second");
        }
    }
}