#include<cstdio>

 #include<cmath>

 #include<algorithm>

 #include<cstring>

 #include<iostream>

 int ch[][],n,m,sz,f[],root,flag;

 char s[];

 int read(){

     int t=,f=;char ch=getchar();

     while (ch<''||ch>''){if (ch=='-') f=-;ch=getchar();}

     while (''<=ch&&ch<=''){t=t*+ch-'';ch=getchar();}

     return t*f;

 }

 void insert(){

     scanf("%s",s+);

     int now=root,len=strlen(s+);

     for (int i=;i<=len;i++){

        if (ch[now][s[i]-'a']==) ch[now][s[i]-'a']=++sz;

        now=ch[now][s[i]-'a'];

     }

 }

 int dfs(int x,int fa){

     bool pd=;int ans=;

     for (int i=;i<;i++)

      if (ch[x][i]){

         ans|=dfs(ch[x][i],x)^;

         pd=;

      }

     if (!pd) ans=;

     return ans;

 }

 int main(){

     n=read();m=read();

     for (int i=;i<=n;i++){

         insert();

     }

     int tmp=dfs(,);

     if (tmp==) printf("First");

     else

     if (tmp==){

         if (m%==) printf("First");

         else printf("Second");

     }

     else

     printf("Second");

     return ;

 }