#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
int child[maxn][26];
int dp[maxn][2];
char s[maxn];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  int cnt = 0;
  memset(child, -1, sizeof child);
  for (int i = 0; i < n; ++i) {
    scanf("%s", s);
    int cur = 0;
    for (int j = 0; s[j]; ++j) {
      int now = s[j] - 'a';
      if (child[cur][now] == -1) {
        child[cur][now] = ++cnt;
      }
      cur = child[cur][now];
    }
  }
  memset(dp, -1, sizeof dp);
  for (int i = cnt; i >= 0; --i) {
    bool ok = true;
    for (int j = 0; j < 26; ++j) {
      if (child[i][j] != -1) {
        ok = false;
        break;
      }
    }
    if (ok) {
      dp[i][0] = 0;
      dp[i][1] = 1;
      continue;
    }
    dp[i][0] = 0;
    dp[i][1] = 0;
    for (int j = 0; j < 26; ++j) {
      if (child[i][j] != -1) {
        if (dp[child[i][j]][0] == 0) {
          dp[i][0] = 1;
        }
        if (dp[child[i][j]][1] == 0) {
          dp[i][1] = 1;
        }
      }
    }
  }
  if (!dp[0][0]) {
    puts("Second");
    return 0;
  }
  if (dp[0][1]) {
    puts("First");
    return 0;
  }
  if ((k & 1) == 0) {
    puts("Second");
  } else {
    puts("First");
  }
}
