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.util.Arrays;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Reader;
import java.io.InputStream;

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

class TaskB {

    Vertex[] vertexes;
    int sz = 1;

    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int n = in.nextInt();
        int k = in.nextInt();

        String[] strings = new String[n];
        int sumLen = 0;
        for (int i = 0; i < n; i++) {
            strings[i] = in.next();
            sumLen += strings[i].length();
        }
        vertexes = new Vertex[sumLen + 1];
        for (int i = 0; i <= sumLen; i++) {
            vertexes[i] = new Vertex();
        }

        for (int i = 0; i < strings.length; i++) {
            addString(strings[i]);
        }

        boolean firstCanWin = dfs(0);
        boolean firstCanLoose = dfsToLoose(0);
        if (firstCanWin && firstCanLoose) {
            out.println("First");
            return;
        }

        if (firstCanWin) {
            //firstCanLoose = false
            if (k % 2 == 1) {
                out.println("First");
                return;
            } else {
                out.println("Second");
                return;
            }
        } else {
            out.println("Second");
            return;
        }
    }

    private boolean dfs(int v) {
        boolean result = false;
        for (int next : vertexes[v].edge) {
            if (next != -1) {
                result = result || (!dfs(next));
            }
        }
        return result;
    }

    private boolean dfsToLoose(int v) {
        if (vertexes[v].isEmpty()) {
            return true;
        } else {
            for (int next : vertexes[v].edge) {
                if (next != -1) {
                    if (!dfsToLoose(next)) {
                        return true;
                    }
                }
            }
            return false;
        }

    }

    private void addString(String str) {
        int v = 0;
        for (int i = 0; i < str.length(); i++) {
            int lM = str.charAt(i) - 'a';
            if (vertexes[v].edge[lM] == -1) {
                vertexes[v].edge[lM] = sz++;
            }
            v = vertexes[v].edge[lM];
        }
    }

    private static class Vertex {
        private int[] edge;

        public Vertex() {
            this.edge = new int[26];
            Arrays.fill(edge, -1);
        }

        public boolean isEmpty() {
            for (int t : edge) {
                if (t != -1) {
                    return false;
                }
            }
            return true;
        }
    }
}

class InputReader {
    public BufferedReader reader;
    private String[] currentArray;
    int curPointer;

    public InputReader(InputStream inputStream) {
        reader = new BufferedReader(new InputStreamReader(inputStream));
    }

    public String next() {
        try {
            currentArray = null;
            return reader.readLine();
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }

    public int nextInt() {
        if ((currentArray == null) || (curPointer >= currentArray.length)) {
            try {
                currentArray = reader.readLine().split(" ");
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
            curPointer = 0;
        }
        return Integer.parseInt(currentArray[curPointer++]);
    }

}

