using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var a = NList;
        var f = 0L;
        var s = 0L;
        var isfirst = true;
        for (var i = 0; i < n; ++i)
        {
            if (a[i] == 1)
            {
                if (isfirst) f += 1 - m;
                else s += 1 - m;
                isfirst = !isfirst;
            }
            else if (i + 1 < n && a[i + 1] == 1)
            {
                var len = 0;
                for (var j = i + 1; j < n; ++j)
                {
                    if (a[j] != 1) break;
                    ++len;
                }
                if (len % 2 == 0)
                {
                    if (isfirst)
                    {
                        f += a[i] - 1;
                        s += 1 - m;
                    }
                    else
                    {
                        s += a[i] - 1;
                        f += 1 - m;
                    }
                }
                else
                {
                    if (isfirst) f += a[i] - m;
                    else s += a[i] - m;
                    isfirst = !isfirst;
                }
            }
            else
            {
                if (isfirst)
                {
                    f += a[i] - 1;
                    s += 1 - m;
                }
                else
                {
                    s += a[i] - 1;
                    f += 1 - m;
                }
            }
        }
        WriteLine(f > s ? "First" : "Second");
    }
}