#include <bits/stdc++.h>
using namespace std;
const long long M = 1e5 + 2;
vector<vector<long long> > tr(M, vector<long long>(26, -1));
long long used = 1;
bool preferWin;
vector<bool> dp(M);
void add(string s) {
  long long cur = 0;
  for (long long i = 0; i < (long long)s.size(); i++) {
    if (tr[cur][s[i] - 'a'] == -1) {
      tr[cur][s[i] - 'a'] = used++;
    }
    cur = tr[cur][s[i] - 'a'];
  }
}
void dfs(long long u) {
  dp[u] = !(preferWin);
  bool fl = false;
  for (long long i = 0; i < 26; i++) {
    if (tr[u][i] != -1) {
      fl = true;
      dfs(tr[u][i]);
      if (preferWin && !dp[tr[u][i]]) {
        dp[u] = true;
      } else if (!preferWin && dp[tr[u][i]]) {
        dp[u] = false;
      }
    }
  }
  if (!fl) {
    dp[u] = false;
  }
}
void solve() {
  long long n, k;
  cin >> n >> k;
  for (long long i = 0; i < n; i++) {
    string s;
    cin >> s;
    add(s);
  }
  preferWin = true;
  dfs(0);
  bool canWin = dp[0];
  preferWin = false;
  dfs(0);
  bool canLose = !dp[0];
  if (canWin && canLose) {
    cout << "First" << '\n';
  } else if (canWin) {
    if (k & 1) {
      cout << "First" << '\n';
    } else {
      cout << "Second" << '\n';
    }
  } else {
    cout << "Second" << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tc;
  tc = 1;
  for (int i = 1; i <= tc; i++) {
    solve();
  }
  return 0;
}
