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

public class Main {
    private static StringTokenizer st;
    private static BufferedReader br;
    public static long MOD = 1000000007;

    public static void print(Object x) {
        System.out.println(x + "");
    }
    public static String join(List<?> x, String space) {
        StringBuilder sb = new StringBuilder();
        for (Object elt : x) {
            sb.append(elt);
            sb.append(space);
        }
        return sb.toString();
    }

    public static String nextToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine().trim());
        }
        return st.nextToken();
    }
    public static double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
    public static long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
    public static int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }
    public static List<Double> nextDoubles(int n) throws IOException{
        List<Double> lst = new ArrayList<Double>();
        for (int i = 0; i < n; i++) {
            lst.add(nextDouble());
        }
        return lst;
    }
    public static List<Integer> nextInts(int n) throws IOException{
        List<Integer> lst = new ArrayList<Integer>();
        for (int i = 0; i < n; i++) {
            lst.add(nextInt());
        }
        return lst;
    }
    public static List<Long> nextLongs(int n) throws IOException{
        List<Long> lst = new ArrayList<Long>();
        for (int i = 0; i < n; i++) {
            lst.add(nextLong());
        }
        return lst;
    }
    public static List<Integer> emptyList(int n, int val) {
        List<Integer> lst = new ArrayList<Integer>();
        for (int i = 0; i < n; i++) {
            lst.add(val);
        }
        return lst;
    }

    public static class Trie {
        Map<String, Trie> children;

        public Trie() {
            children = new HashMap<String, Trie>();
        }

        public void addString(String s) {
            if (s.length() == 0) return;
            String first = s.substring(0, 1);
            if (!children.containsKey(first)) children.put(first, new Trie());
            Trie child = children.get(first);
            child.addString(s.substring(1));
        }

        public boolean p1Win() {
            if (children.size() == 0) return false;
            for (Map.Entry<String, Trie> entry : children.entrySet()) {
                Trie child = entry.getValue();
                if (!child.p1Win()) return true;
            }
            return false;
        }

        public boolean p1Lose() {
            if (children.size() == 0) return true;
            for (Map.Entry<String, Trie> entry : children.entrySet()) {
                Trie child = entry.getValue();
                if (!child.p1Lose()) return true;
            }
            return false;
        }
    }

    public static String solve(Trie root, int k) {
        boolean w1 = root.p1Win();
        boolean l1 = root.p1Lose();
        if (!w1) {
            return "Second";
        } else {
            if (l1) {
                return "First";
            } else if (k % 2 == 0) {
                return "Second";
            } else {
                return "First";
            }
        }
    }

    public static void main(String[] args) throws Exception {
        boolean debug = false;
        InputStream in = System.in;
        if (debug) {
            in = new FileInputStream("input.in");
        }
        br = new BufferedReader(new InputStreamReader(in));

        int n = nextInt();
        int k = nextInt();
        Trie root = new Trie();
        for (int i = 0; i < n; i++) {
            root.addString(nextToken());
        }

        print(solve(root, k));
    }
}