#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace std;
const long long N = 1e5 + 5;
int cnt = 1;
vector<vector<int>> tree(N, vector<int>(256, -1));
void add(string s) {
  int i = 0, v = 0;
  while (i < s.length()) {
    if (tree[v][s[i]] == -1) tree[v][s[i]] = cnt++;
    v = tree[v][s[i]];
    i++;
  }
}
int check(int v) {
  map<int, bool> s;
  for (long long i = 0; i < 256; i++) {
    if (tree[v][i] != -1) {
      s[check(tree[v][i])] = true;
    }
  }
  if (s.empty()) return -1;
  if (s[-2] || (s[1] && s[-1])) return 2;
  if (s[1]) {
    return -1;
  } else if (s[-1]) {
    return 1;
  } else {
    return -2;
  }
}
void solve() {
  int n, k;
  cin >> n >> k;
  for (long long i = 0; i < n; i++) {
    string s;
    cin >> s;
    add(s);
  }
  int ans = check(0);
  if (ans == 2)
    cout << "First" << endl;
  else if (ans == -2)
    cout << "Second" << endl;
  else if (ans == -1) {
    cout << "Second" << endl;
  } else {
    if (k % 2)
      cout << "First" << endl;
    else
      cout << "Second" << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  t = 1;
  while (t--) solve();
  return 0;
}
