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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class TaskB {
  
  private final BufferedReader in;
  private final PrintWriter out;
  private StringTokenizer tokenizer;
  
  private TaskB(BufferedReader in, PrintWriter out) {
    this.in = in;
    this.out = out;
    this.tokenizer = new StringTokenizer("");
  }
  
  private static TaskB createSolution() {
    BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    PrintWriter out = new PrintWriter(System.out);
    return new TaskB(in, out);
  }
  
  public static void main(String[] args) {
    try {
      TaskB solution = createSolution();
      solution.solve();
      solution.close();
    } catch (Exception e) {
      e.printStackTrace(System.err);
      System.exit(-1);
    }
  }
  
  private String readString() throws IOException {
    while (!tokenizer.hasMoreTokens()) {
      tokenizer = new StringTokenizer(in.readLine());
    }
    return tokenizer.nextToken();
  }
  
  private int readInt() throws IOException {
    return Integer.parseInt(readString());
  }
  
  private long readLong() throws IOException {
    return Long.parseLong(readString());
  }

  private double readDouble() throws IOException {
    return Double.parseDouble(readString());
  }
  
  private void writeInt(int integer) {
    out.print(integer);
  }
  
  private void writeInts(int[] integers, String separator) {
    String string = Arrays.toString(integers).replaceAll(", ", separator);
    out.print(string.substring(1, string.length() - 1));
  }
  
  private void close() throws IOException {
    in.close();
    out.close();
  }
  
  private void solve() throws Exception {
    int n = readInt();
    int k = readInt();
    Trie words = new Trie();
    for (int i = 0; i < n; i++) {
      words.add(readString());
    }
    boolean firstPlayerWins = canFirstPlayerChooseToWin(words);
    boolean firstPlayerLoses = canFirstPlayerChooseToLose(words);
    String winner = determineWinner(firstPlayerWins, firstPlayerLoses, k);
    out.write(winner);
  }
  
  private String determineWinner(boolean firstPlayerWins, boolean firstPlayerLoses, int k) {
    if (firstPlayerLoses) {
      if (firstPlayerWins) {
        return "First";
      } else {
        return "Second";
      }
    } else {
      if (firstPlayerWins) {
        return ((k % 2) == 0) ? "Second" : "First";
      } else {
        return "Second";
      }
    }
  }

  private boolean canFirstPlayerChooseToWin(Trie words) {
    return minMax(words, false);
  }
    
  private boolean canFirstPlayerChooseToLose(Trie words) {
    return minMax(words, true);
  }

  private boolean minMax(Trie words, boolean emptyWord) {
    if (words.hasChildren) {
      for (int i = 0; i < 26; i++) {
        Trie child = words.children[i];
        if (child != null) {
          if (!minMax(child, emptyWord)) {
            return true;
          }
        }
      }
      return false;
    } else {
      return emptyWord;
    }
  }

  private static class Trie {
    public final Trie[] children = new Trie[26];
    public boolean hasChildren = false;

    public Trie() {
      // empty
    }

    public void add(String readString) {
      add(readString.toCharArray(), 0);
    }
    
    private void add(char[] charArray, int i) {
      char letter = charArray[i];
      int index = letter - 'a';
      hasChildren = true;
      Trie child = getChild(index);
      if (i + 1 < charArray.length) {
        child.add(charArray, i + 1);
      }
    }
    
    private Trie getChild(int index) {
      if (children[index] == null) {
        children[index] = new Trie();
      }
      return children[index];
    }
    
  }
}
