Andrew, Fedor and Alex are inventive guys. Now they invent the game with strings for two players.

Given a group of n non-empty strings. During the game two players build the word together, initially the word is empty. The players move in turns. On his step player must add a single letter in the end of the word, the resulting word must be prefix of at least one string from the group. A player loses if he cannot move.

Andrew and Alex decided to play this game k times. The player who is the loser of the i-th game makes the first move in the (i + 1)-th game. Guys decided that the winner of all games is the player who wins the last (k-th) game. Andrew and Alex already started the game. Fedor wants to know who wins the game if both players will play optimally. Help him.

Input

The first line contains two integers, n and k (1 ≤ n ≤ 105; 1 ≤ k ≤ 109).

Each of the next n lines contains a single non-empty string from the given group. The total length of all strings from the group doesn't exceed 105. Each string of the group consists only of lowercase English letters.

Output

If the player who moves first wins, print "First", otherwise print "Second" (without the quotes).

Examples

Input

2 3
a
b


Output

First


Input

3 1
a
b
c


Output

First


Input

1 2
ab


Output

Second
	                            import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.Map;
import java.util.TreeMap;
import java.util.TreeSet;
	
	
	
	                                            public class Solution1 implements Runnable
	                                            {
	                                                static final long MAX = 464897L;
	                                                static class InputReader
	                                                {
	                                                    private InputStream stream;
	                                                    private byte[] buf = new byte[1024];
	                                                    private int curChar;
	                                                    private int numChars;
	                                                    private SpaceCharFilter filter;
	                                                    private BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	                                             
	                                                    public InputReader(InputStream stream)
	                                                    {
	                                                        this.stream = stream;
	                                                    }
	                                                    
	                                                    public int read()
	                                                    {
	                                                        if (numChars==-1) 
	                                                            throw new InputMismatchException();
	                                                        
	                                                        if (curChar >= numChars)
	                                                        {
	                                                            curChar = 0;
	                                                            try 
	                                                            {
	                                                                numChars = stream.read(buf);
	                                                            }
	                                                            catch (IOException e)
	                                                            {
	                                                                throw new InputMismatchException();
	                                                            }
	                                                            
	                                                            if(numChars <= 0)                
	                                                                return -1;
	                                                        }
	                                                        return buf[curChar++];
	                                                    }
	                                                 
	                                                    public String nextLine()
	                                                    {
	                                                        String str = "";
	                                                        try
	                                                        {
	                                                            str = br.readLine();
	                                                        }
	                                                        catch (IOException e)
	                                                        {
	                                                            e.printStackTrace();
	                                                        }
	                                                        return str;
	                                                    }
	                                                    public int nextInt()
	                                                    {
	                                                        int c = read();
	                                                        
	                                                        while(isSpaceChar(c)) 
	                                                            c = read();
	                                                        
	                                                        int sgn = 1;
	                                                        
	                                                        if (c == '-') 
	                                                        {
	                                                            sgn = -1;
	                                                            c = read();
	                                                        }
	                                                        
	                                                        int res = 0;
	                                                        do 
	                                                        {
	                                                            if(c<'0'||c>'9') 
	                                                                throw new InputMismatchException();
	                                                            res *= 10;
	                                                            res += c - '0';
	                                                            c = read();
	                                                        }
	                                                        while (!isSpaceChar(c)); 
	                                                        
	                                                        return res * sgn;
	                                                    }
	                                                    
	                                                    public long nextLong() 
	                                                    {
	                                                        int c = read();
	                                                        while (isSpaceChar(c))
	                                                            c = read();
	                                                        int sgn = 1;
	                                                        if (c == '-') 
	                                                        {
	                                                            sgn = -1;
	                                                            c = read();
	                                                        }
	                                                        long res = 0;
	                                                        
	                                                        do 
	                                                        {
	                                                            if (c < '0' || c > '9')
	                                                                throw new InputMismatchException();
	                                                            res *= 10;
	                                                            res += c - '0';
	                                                            c = read();
	                                                        }
	                                                        while (!isSpaceChar(c));
	                                                            return res * sgn;
	                                                    }
	                                                    
	                                                    public double nextDouble() 
	                                                    {
	                                                        int c = read();
	                                                        while (isSpaceChar(c))
	                                                            c = read();
	                                                        int sgn = 1;
	                                                        if (c == '-') 
	                                                        {
	                                                            sgn = -1;
	                                                            c = read();
	                                                        }
	                                                        double res = 0;
	                                                        while (!isSpaceChar(c) && c != '.') 
	                                                        {
	                                                            if (c == 'e' || c == 'E')
	                                                                return res * Math.pow(10, nextInt());
	                                                            if (c < '0' || c > '9')
	                                                                throw new InputMismatchException();
	                                                            res *= 10;
	                                                            res += c - '0';
	                                                            c = read();
	                                                        }
	                                                        if (c == '.') 
	                                                        {
	                                                            c = read();
	                                                            double m = 1;
	                                                            while (!isSpaceChar(c)) 
	                                                            {
	                                                                if (c == 'e' || c == 'E')
	                                                                    return res * Math.pow(10, nextInt());
	                                                                if (c < '0' || c > '9')
	                                                                    throw new InputMismatchException();
	                                                                m /= 10;
	                                                                res += (c - '0') * m;
	                                                                c = read();
	                                                            }
	                                                        }
	                                                        return res * sgn;
	                                                    }
	                                                    
	                                                    public String readString() 
	                                                    {
	                                                        int c = read();
	                                                        while (isSpaceChar(c))
	                                                            c = read();
	                                                        StringBuilder res = new StringBuilder();
	                                                        do 
	                                                        {
	                                                            res.appendCodePoint(c);
	                                                            c = read();
	                                                        } 
	                                                        while (!isSpaceChar(c));
	                                                        
	                                                        return res.toString();
	                                                    }
	                                                 
	                                                    public boolean isSpaceChar(int c) 
	                                                    {
	                                                        if (filter != null)
	                                                            return filter.isSpaceChar(c);
	                                                        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	                                                    }
	                                                 
	                                                    public String next() 
	                                                    {
	                                                        return readString();
	                                                    }
	                                                    
	                                                    public interface SpaceCharFilter 
	                                                    {
	                                                        public boolean isSpaceChar(int ch);
	                                                    }
	                                                }
	                                                 
	                                                public static void main(String args[]) throws Exception
	                                                {
	                                                    new Thread(null, new Solution1(),"Solution",1<<26).start();
	                                                }    
	                                                public static long gcd(long a, long b)
	                                                {
	                                                    if (a == 0)
	                                                        return b;
	                                                     
	                                                    return gcd(b%a, a);
	                                                }
	                                                long lcm(long a, long b)
	                                                {
	                                                    return (a*b)/gcd(a, b);
	                                                }
	                                                static class Node{
	                                                	Node[] ch;
	                                                	int marji;
	                                                	int definite;
	                                                	Node(){
	                                                		ch = new Node[26];
	                                                		this.marji = -1;
	                                                		this.definite = -1;
	                                                	}
	                                                }
	                                                public void run() 
	                                                {
	                                                    
	                                                        //InputReader sc= new InputReader(new FileInputStream("input.txt"));
	                                                        //PrintWriter w= new PrintWriter(new FileWriter("output.txt"));
	                                                        InputReader sc = new InputReader(System.in);
	                                                        PrintWriter w = new PrintWriter(System.out);
	                                                        int n = sc.nextInt();
	                                                        int k = sc.nextInt();
	                                                        root = new Node();
	                                                        for(int i = 0;i < n;i++) {
	                                                        	String s = sc.next();
	                                                        	insert(s);
	                                                        }
	                                                        dfs(root,1);
	                                                        boolean f1 = false;
	                                                        boolean f2 = false;
	                                                        for(int i = 0;i < 26;i++) {
	                                                        	if(root.ch[i] != null) {
	                                                        		if(root.ch[i].marji == 0){
	                                                        			w.println("First");
	                                                        			w.close();
	                                                        		}
	                                                        		if(k % 2 != 0 && root.ch[i].definite == 0) {
	                                                        			w.println("First");
	                                                        			w.close();
	                                                        		}if(root.ch[i].definite == 1) {
	                                                        			f2 = true;
	                                                        		}if(root.ch[i].definite == 0) {
	                                                        			f1 = true;
	                                                        		}
	                                                        	}
	                                                        }
	                                                        if(f1 & f2) {
	                                                        	w.println("First");
	                                                        	w.close();
	                                                        }
	                                                        w.println("Second");
	                                                        w.close();	                                                                                                                      
	                                                 }
	                                                Node root;
	                                                void insert(String s) {
	                                                	Node temp = root;
	                                                	for(int i = 0;i < s.length();i++) {
	                                                		int cha = s.charAt(i)-97;
                                                    		if(temp.ch[cha] == null) {
                                                    			temp.ch[cha] = new Node();
                                                    		}
                                                    		temp = temp.ch[cha];
                                                    	
	                                                	}
	                                                }
	                                                void dfs(Node curr,int dav) {
	                                                	for(int i = 0;i < 26;i++) {
	                                                		if(curr.ch[i] != null) {
	                                                			dfs(curr.ch[i],dav ^ 1);
	                                                		}
	                                                	}
	                                                	boolean one = false;
	                                                	boolean two = false;
	                                                	boolean twomargi = false;
	                                                	for(int i = 0;i < 26;i++) {
	                                                		if(curr.ch[i] != null) {
	                                                			if(curr.ch[i].marji == (dav ^ 1)) {
	                                                				curr.marji = dav ^ 1;
	                                                				curr.definite = -1;
	                                                				break;
	                                                			}else if(curr.ch[i].marji == dav) {
	                                                				twomargi = true;
	                                                			}else if(curr.ch[i].definite == dav) {
	                                                				one = true;
	                                                			}else if(curr.ch[i].definite == (dav ^ 1)) {
	                                                				two = true;
	                                                			}
	                                                		}if(i == 25 && !one & !two & !twomargi) {
	                                                			curr.definite = dav;
	                                                		}
	                                                	}
	                                                	if(curr.marji == -1 && curr.definite == -1) {
	                                                		boolean res = one | two;
	                                                		if(!res) {
	                                                			curr.marji = dav;
	                                                			curr.definite = -1;
	                                                		}else {
	                                                			if(one & two) {
	                                                				curr.marji = dav^1;
	                                                				curr.definite = -1;
	                                                			}else {
	                                                				if(one) {
	                                                					curr.definite = dav;
	                                                				}else {
	                                                					curr.definite = dav^1;
	                                                				}
	                                                				curr.marji = -1;
	                                                			}
	                                                		}
	                                                	}
	                                                }
	                                }