#include <bits/stdc++.h>
using namespace std;
int a[100002][27], d = 1;
bool win[100002];
bool los[100002];
void tol(string s) {
  int t = 1;
  for (int i = 0; i < s.size(); i++) {
    int x = (int)s[i] - 97;
    if (a[t][x] == 0) {
      a[t][x] = ++d;
    }
    t = a[t][x];
  }
}
void dfs(int v) {
  bool ok = 1;
  win[v] = 0;
  los[v] = 0;
  for (int i = 0; i < 26; i++) {
    if (a[v][i] != 0) {
      ok = 0;
      dfs(a[v][i]);
      if (!win[a[v][i]]) {
        win[v] = 1;
      }
      if (!los[a[v][i]]) {
        los[v] = 1;
      }
    }
  }
  if (ok) {
    win[v] = 0;
    los[v] = 1;
  }
}
int main() {
  int n, k, i, j;
  cin >> n >> k;
  string s;
  for (i = 1; i <= n; i++) {
    cin >> s;
    tol(s);
  }
  dfs(1);
  if (win[1] && los[1]) {
    cout << "First";
    return 0;
  }
  if (!win[1]) cout << "Second";
  if (win[1] && !los[1]) {
    if (k % 2 == 0)
      cout << "Second";
    else
      cout << "First";
  }
  return 0;
}
