#include <bits/stdc++.h>
using namespace std;
int p;
struct Trie {
  int next[27][200005], vv[200005];
  bool vis[200005];
  int sz;
  void nn() { memset(vv, -1, sizeof vv); }
  void insertTrie(string s, int j) {
    int v = 0;
    for (int i = 0; i < s.size(); i++) {
      int c = s[i] - 'a';
      if (!vis[next[c][v]]) {
        next[c][v] = ++sz;
        vis[sz] = true;
      }
      v = next[c][v];
      if (vv[v] > 0 && j == 0) {
        vv[v] = j;
      } else if (vv[v] == -1)
        vv[v] = j;
    }
  }
  int searchTrie(int j, int v, int r) {
    r++;
    if (v == 0 && !next[j][v]) return -2;
    v = next[j][v];
    int p = 0, jk = 0, r1 = 0, r2 = 0, r3 = 0, r4 = 0, y;
    for (int i = 0; i <= 26; i++) {
      if (vis[next[i][v]]) {
        p = 1;
        jk++;
        y = searchTrie(i, v, r);
        if (y == -1)
          r3++;
        else if (y == 2)
          r4++;
        else if (y == 1)
          r1++;
        else
          r2++;
      }
    }
    if (!p) {
      if (r % 2 == 0)
        return 0;
      else
        return 1;
    } else {
      if (jk == 1)
        return y;
      else if ((r + 1) % 2 == 0) {
        if (r3 > 0)
          return -1;
        else if (r1 > 0 && r2 > 0)
          return -1;
        else if (r1 > 0)
          return 1;
        else if (r2 > 0)
          return 0;
      } else {
        if (r1 > 0 && r2 > 0)
          return 2;
        else if (r4 > 0)
          return 2;
        else if (r1 > 0)
          return 1;
        else if (r2 > 0)
          return 0;
        else
          return -1;
      }
    }
  }
} t;
int main() {
  t.nn();
  int tt, n, i, j, k, m, h0 = 0, h1 = 0, h2 = 0, h3 = 0;
  cin >> n >> k;
  string s[n + 5];
  p = 0;
  for (i = 0; i < n; i++) {
    cin >> s[i];
    m = s[i].size();
    t.insertTrie(s[i], m % 2);
  }
  for (i = 0; i <= 26; i++) {
    int rr = t.searchTrie(i, 0, 0);
    if (rr == 2)
      h2++;
    else if (rr == -1)
      h3++;
    else if (rr == 1)
      h1++;
    else if (rr == 0)
      h0++;
  }
  if (h2 > 0 || (h1 > 0 && h0 > 0))
    cout << "First" << endl;
  else if (h1 > 0) {
    if (k % 2 == 0)
      cout << "Second" << endl;
    else
      cout << "First" << endl;
  } else if (h0 > 0)
    cout << "Second" << endl;
  else {
    cout << "Second" << endl;
  }
  return 0;
}
