#include <bits/stdc++.h>
using namespace std;
int tr[100005][27];
int dp[100005];
int dp2[100005];
void dfs(int ind, int x, char a) {
  bool z = false;
  for (int i = 0; i < 27; i++) {
    if (tr[ind][i]) {
      dfs(tr[ind][i], !x, 'a' + i);
      if (dp[ind] == -1) {
        dp[ind] = dp[tr[ind][i]];
        dp2[ind] = dp2[tr[ind][i]];
      } else {
        if (!x) {
          dp[ind] |= dp[tr[ind][i]];
          dp2[ind] |= dp2[tr[ind][i]];
        } else {
          dp[ind] &= dp[tr[ind][i]];
          dp2[ind] &= dp2[tr[ind][i]];
        }
      }
      z = true;
    }
  }
  if (!z) {
    dp[ind] = x;
    dp2[ind] = !x;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  memset(dp, -1, sizeof dp);
  int n, k;
  cin >> n >> k;
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    string a;
    cin >> a;
    int t = 0;
    for (int j = 0; j < a.length(); j++) {
      if (tr[t][a[j] - 'a'] == 0) tr[t][a[j] - 'a'] = ++cnt;
      t = tr[t][a[j] - 'a'];
    }
  }
  dfs(0, 0, ' ');
  if (dp2[0] && dp[0])
    cout << "First";
  else if (dp[0]) {
    if (k % 2 == 1)
      cout << "First";
    else
      cout << "Second";
  } else
    cout << "Second";
  return 0;
}
