#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 1000;
const int A = 26 + 1;
int out[maxn][26], cnt = 1, dp[maxn], pd[maxn];
void add(string t) {
  int v = 0;
  for (int i = 0; i < t.size(); ++i) {
    char c = (int)(t[i] - 'a');
    if (!out[v][c]) {
      out[v][c] = cnt++;
    }
    v = out[v][c];
  }
}
void dfs(int v) {
  bool isleaf = 1;
  for (int i = 0; i < 26; ++i) {
    if (out[v][i]) {
      dfs(out[v][i]);
      isleaf = 0;
    }
  }
  if (isleaf) {
    dp[v] = 0;
    pd[v] = 1;
  } else {
    for (int i = 0; i < 26; ++i) {
      if (out[v][i]) {
        if (!dp[out[v][i]]) {
          dp[v] = 1;
        }
        if (!pd[out[v][i]]) {
          pd[v] = 1;
        }
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  string s;
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    cin >> s;
    add(s);
  }
  dfs(0);
  if (!dp[0]) {
    cout << "Second" << endl;
  } else {
    if (pd[0]) {
      cout << "First" << endl;
    } else {
      if (k & 1) {
        cout << "First" << endl;
      } else {
        cout << "Second" << endl;
      }
    }
  }
  return 0;
}
