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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Locale;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import java.util.Queue;
import java.util.SortedMap;
import java.util.SortedSet;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

public class Solver {

    StringTokenizer st;
    BufferedReader in;
    PrintWriter out;

    public static void main(String[] args) throws NumberFormatException, IOException {
        Solver solver = new Solver();
        long time = System.currentTimeMillis();
        solver.open();
        solver.solve();
        // System.out.println("Spend time:" + (System.currentTimeMillis() -
        // time));
        solver.close();
    }

    public void open() throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(new OutputStreamWriter(System.out));
        // in = new BufferedReader(new FileReader("input.txt"));
        // out = new PrintWriter(new OutputStreamWriter(System.out));
    }

    boolean hasMoreTokens() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            String line = in.readLine();
            if (line == null)
                return false;
            st = new StringTokenizer(line);
        }
        return true;
    }

    public String nextToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            String line = in.readLine();
            if (line == null)
                return null;
            st = new StringTokenizer(line);
        }
        return st.nextToken();
    }

    public int nextInt() throws NumberFormatException, IOException {
        return Integer.parseInt(nextToken());
    }

    public long nextLong() throws NumberFormatException, IOException {
        return Long.parseLong(nextToken());
    }

    public double nextDouble() throws NumberFormatException, IOException {
        return Double.parseDouble(nextToken());
    }

    class Node {
        final Map<Character, Node> child = new HashMap<>();

        void add(final char[] c, final int pos) {
            if (pos < c.length) {
                Node node = child.get(c[pos]);
                if (node == null)
                    child.put(c[pos], node = new Node());
                node.add(c, pos + 1);
            }
        }

        boolean win() {
            for (final Node t : child.values())
                if (!t.win())
                    return true;
            return false;
        }

        boolean loose() {
            if (child.isEmpty())
                return true;
            for (final Node t : child.values())
                if (!t.loose())
                    return true;
            return false;
        }
    }

    public void solve() throws NumberFormatException, IOException {
        final int n = nextInt();
        final int k = nextInt();

        final Node root = new Node();

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

        final boolean win = root.win();
        final boolean loose = root.loose();

        if (!win) {
            out.println("Second");
        } else {
            if (loose) {
                out.println("First");
            } else {
                out.println(k % 2 == 1 ? "First" : "Second");
            }
        }
    }

    public void close() {
        out.flush();
        out.close();
    }
}