#include <bits/stdc++.h>
using namespace std;
long long int tri[100001][26], sz = 0, root = 0;
void addIt(string& s) {
  int len = s.length(), i, j, v;
  v = root;
  for (i = 0; i < len; i++) {
    int p = s[i] - 'a';
    if (tri[v][p] == 0) {
      tri[v][p] = ++sz;
    }
    v = tri[v][p];
  }
}
int win[100001], los[100001];
void doIt(long long int v) {
  int i, j;
  j = 1;
  win[v] = 0;
  los[v] = 0;
  for (i = 0; i < 26; i++) {
    if (tri[v][i] != 0) {
      j = 0;
      doIt(tri[v][i]);
      win[v] |= !win[tri[v][i]];
      los[v] |= !los[tri[v][i]];
    }
  }
  if (j == 1) los[v] = 1;
}
int main() {
  long long int n, k, i, j;
  string s;
  scanf("%lld %lld", &n, &k);
  for (i = 0; i < n; i++) {
    cin >> s;
    addIt(s);
  }
  doIt(root);
  if (!win[root])
    cout << "Second" << endl;
  else if (win[root] && los[root])
    cout << "First" << endl;
  else if (win[root] && !los[root])
    if (k % 2 == 0)
      cout << "Second" << endl;
    else
      cout << "First" << endl;
  return 0;
}
